Simple peer selection strategies for fast and fair peer-to-peer file sharing

Authors:
Chih-Lin Hu;Yi-Hsun Chang;Da-You Chen;Yu-Wen Chen
Affiliations:
Department of Communication Engineering, National Central University, Taoyuan, Taiwan, R.O.C.;Department of Communication Engineering, National Central University, Taoyuan, Taiwan, R.O.C.;Department of Communication Engineering, National Central University, Taoyuan, Taiwan, R.O.C.;Department of Communication Engineering, National Central University, Taoyuan, Taiwan, R.O.C.
Venue:
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Year:
2010

Citing 8
Cited 0

Reputation systems

Communications of the ACM
Modeling and performance analysis of BitTorrent-like peer-to-peer networks

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Comparing economic incentives in peer-to-peer networks

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
A survey of peer-to-peer content distribution technologies

ACM Computing Surveys (CSUR)
Overcoming free-riding behavior in peer-to-peer systems

ACM SIGecom Exchanges
Understanding churn in peer-to-peer networks

Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Bandwidth trading in BitTorrent-like P2P networks for content distribution

Computer Communications
A survey and comparison of peer-to-peer overlay network schemes

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper proposes an adaptive peer selection strategy in support of fast and fair peer-to-peer file sharing applications. According to specific features of peer duality, the system server is able to schedule download requests by degrees of peers' contributions, and correspondingly assign server peers in charge to process requests by degrees of peers' capacities. In addition, several functional extensions, substitute and elimination processes, are further associated to cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results exhibit that the proposed mechanisms are simple, but effective in maintenance of service agility, fairness and resource utilization, affected by critical peer churn and free riding problems.