File Delivery with Longest Processing Time First Scheduling in P2P Networks

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.

[1]  Ayalvadi J. Ganesh,et al.  Resource allocation between persistent and transient flows , 2005, IEEE/ACM Transactions on Networking.

[2]  Bin Fan,et al.  The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[3]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[4]  Peter A. Dinda,et al.  Improving peer-to-peer performance through server-side scheduling , 2008, TOCS.

[5]  Yun Ling,et al.  A Dependable Cluster Based Topology in P2P Networks , 2010, J. Commun..

[6]  Lachlan L. H. Andrew,et al.  Powering down for energy efficient peer-to-peer file distribution , 2011, PERV.

[7]  Xuemin Shen,et al.  Handbook of Peer-to-Peer Networking , 2009 .

[8]  Mortada Mehyar.  Distributed averaging and efficient file sharing on peer-to-peer networks , 2007 .

[9]  Giovanni Neglia,et al.  The effect of heterogeneous link capacities in BitTorrent-like file sharing systems , 2004 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Bin Fan,et al.  The Design Trade-Offs of BitTorrent-Like File Sharing Protocols , 2009, IEEE/ACM Transactions on Networking.

[12]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

[13]  Ya Zhou,et al.  A Request Handling Mechanism with the Shortest Processing-Time First in Web Servers , 2008, 2008 International Conference on Computer Science and Software Engineering.

[14]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[15]  Lachlan L. H. Andrew,et al.  Minimizing Average Finish Time in P2P Networks , 2009, IEEE INFOCOM 2009.

[16]  Arun Venkataramani,et al.  Do incentives build robustness in bit torrent , 2007 .

[17]  K. V. Shakhbazyan,et al.  A survey of scheduling methods for multiprocessor systems , 1981 .

[18]  Joseph Y.-T. Leung,et al.  Minimizing mean flowtime and makespan on master-slave systems , 2005, J. Parallel Distributed Comput..

[19]  Gideon Weiss,et al.  Analysis of peer-to-peer file dissemination amongst users of different upload capacities , 2006, PERV.

[20]  Francesca Lo Piccolo,et al.  The effect of heterogeneous link capacities in BitTorrent-like file sharing systems , 2004, 2004 International Workshop on Hot Topics in Peer-to-Peer Systems.