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

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.