Scheduling in P2P file distribution - On reducing the average distribution time

Lui, KS
Ma, L

Open link

Publication date

January 2008

DOI

10.1109/ccnc08.2007.121

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Citation count (estimate)

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. © IEEE.link_to_subscribed_fulltex

Extracted data

We use cookies to provide a better user experience.

Data Protection

Scheduling in P2P file distribution - On reducing the average distribution time

Abstract

Extracted data

Scheduling in P2P file distribution - On reducing the average distribution time

Abstract

Extracted data

Related items

Related items