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)
