Scheduling in P2P File Distribution - On Reducing the Average Distribution Time
Lingjun Ma, King‐Shan Lui · 2008
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.