Prior researches in P2P file sharing mostly focus on several topics such as the overlay topology, the content searching, the peer discovery, the sharing fairness, incentive mechanisms, except scheduling algorithms for peer-to-peer collaborative file distribution. The scheduling algorithm specifies how file pieces are distributed among peers. When a peer that has the rarest piece leaves, the other peers probably download the incomplete file in the network. Our algorithm is involved in the lifetime of peers in the P2P networks. We first use the distribution of peer¡¦s lifetime and the demand of each peer to decide which peers send which pieces that are rarities, and then also consider the distribution of peer¡¦s lifetime and the demand of each peer to decide which peers receive these pieces. Our goals are to maximize number of peers which have downloaded an entire file before it leaves, to increase the availability of different file pieces, and to minimize the transmission time of the latest completion. Lastly, we show the comparison of the performances of RPF, MDNF, Lifetime-based RPF, and Lifetime-based MDNF algorithms.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0806108-164745 |
| Date | 06 August 2008 |
| Creators | Liu, Yun-Chi |
| Contributors | Hung-Yun Hsieh, Hsi-Lu Chao, Wei-Kaung Lai, Chun-Hung Lin, Rung-Hung Gau |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806108-164745 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0017 seconds