On the Performance of Peer Selection Strategies in Stochastic Peer-to-Peer Networks
| dc.contributor.advisor | Do Young Eun, Committee Chair | en_US |
| dc.contributor.author | Chiu, Yuh-Ming | en_US |
| dc.date.accessioned | 2010-04-02T19:14:30Z | |
| dc.date.available | 2010-04-02T19:14:30Z | |
| dc.date.issued | 2009-05-08 | en_US |
| dc.degree.discipline | Electrical Engineering | en_US |
| dc.degree.level | dissertation | en_US |
| dc.degree.name | PhD | en_US |
| dc.description.abstract | Peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for a large portion of the Internet's bandwidth usage. Measurement studies show that a typical download session lasts from hours up to several days depending on the level of network congestion or the service capacity fluctuation. In this thesis, we first consider two major factors that have significant impact on the average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuation in service capacity of a given single source peer. We point out that the common approach of analyzing the average download time, or more generally the performance of peer to peer networks based on average service capacity is fundamentally flawed. We rigorously prove that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks. We then analyze the impact of the interaction and resource competition between peers on the file download performance under stochastic, heterogeneous, unstructured P2P settings. We introduce the notion of system utilization tailored to a P2P network so as to capture the characteristics of the average download time in a P2P network with multiple competing downloading peers. We then derive an achievable lower bound on the average download time and propose a distributed algorithm with which peers can achieve this minimum average download time, thereby bypassing the curse of spatial heterogeneity and temporal stochastic fluctuation. Our algorithm relies on constantly changing connected source peers and selecting source peers probabilistically. The performance of different peer selection algorithms is compared under NS-2 simulations. Our results also provide theoretical explanation to the inconsistency of performance improvement by using parallel connections (parallel connection sometimes does not outperform single connection) observed in some measurement studies. | en_US |
| dc.identifier.other | etd-04162009-154704 | en_US |
| dc.identifier.uri | http://www.lib.ncsu.edu/resolver/1840.16/5474 | |
| dc.rights | I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dis sertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. | en_US |
| dc.subject | Peer-to-peer | en_US |
| dc.subject | Performance Analysis | en_US |
| dc.title | On the Performance of Peer Selection Strategies in Stochastic Peer-to-Peer Networks | en_US |
Files
Original bundle
1 - 1 of 1
