Title :
Scheduling in P2P File Distribution - On Reducing the Average Distribution Time
Author :
Ma Lingjun ; King-Shan Lui
Author_Institution :
Hong Kong Univ., Kowloon
Abstract :
We study in this paper the scheduling problem in P2P file distribution. Our aim is to reduce the average distribution time. We present two distribution mechanisms: distributing the rarest pieces first and distributing to the least demanding nodes first. The new algorithm, rarest-piece-first and most-demanding-node-last-piece-oriented, is developed and we demonstrate by simulation its effectiveness over some related algorithms.
Keywords :
peer-to-peer computing; scheduling; P2P file distribution; average distribution time reduction; scheduling; Bandwidth; Broadcasting; Closed-form solution; Electric breakdown; Large-scale systems; Optimal scheduling; Peer to peer computing; Scheduling algorithm;
Conference_Titel :
Consumer Communications and Networking Conference, 2008. CCNC 2008. 5th IEEE
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-1-4244-1456-7
Electronic_ISBN :
978-1-4244-1457-4
DOI :
10.1109/ccnc08.2007.121
