File Delivery with Longest Processing Time First Scheduling in P2P Networks

Meiho University Institutional Repository > 健康暨護理學院 > 資訊科技系 > 期刊論文 > Item 987654321/2079

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.meiho.edu.tw/ir/handle/987654321/2079

题名:	File Delivery with Longest Processing Time First Scheduling in P2P Networks
作者:	Chun-Hao Wen;Steve W. Haga;Richard Chun-Hung Lin
贡献者:	健康暨護理學院
关键词:	P2P;scheduling;data sharing
日期:	2013
上传时间:	2013-08-27T01:45:57Z (UTC)
摘要:	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.
關聯:	International Journal of Grid and Distributed Computing, 6(2)
显示于类别:	[資訊科技系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
File delivery with longest processing .pdf		396Kb	Adobe PDF	0	检视/开启

检视Licence

在MUIR中所有的数据项都受到原著作权保护.