File Delivery with Longest Processing Time First Scheduling in P2P Networks

MUIR > Graduate Institute of Health Care > Department of Information Technology > Papers > Item 987654321/2079

Please use this identifier to cite or link to this item: http://ir.meiho.edu.tw/ir/handle/987654321/2079

Title:	File Delivery with Longest Processing Time First Scheduling in P2P Networks
Authors:	Chun-Hao Wen;Steve W. Haga;Richard Chun-Hung Lin
Contributors:	健康暨護理學院
Keywords:	P2P;scheduling;data sharing
Date:	2013
Issue Date:	2013-08-27T01:45:57Z (UTC)
Abstract:	Peer-to-peer (P2P) File delivery systems of distributed computing are designed with the understanding that any peer can leave the network at any time, often right after completing its download. The conventional approach to P2P scheduling, shortest processing-time first, is not well suited to peer-leaving situations. We therefore propose a new scheduling algorithm that significantly reduces average finish time in such cases. We further note, at the end of the paper, that our method is also suitable for the more general problem of a dynamic network of peers that may leave early or enter late.
Relation:	International Journal of Grid and Distributed Computing, 6(2)
Appears in Collections:	[Department of Information Technology] Papers

Files in This Item:

File	Description	Size	Format
File delivery with longest processing .pdf		396Kb	Adobe PDF	0	View/Open

View Licence