Copyright © 2005 Elsevier B.V. All rights reserved.
Performance of peer-to-peer networks: Service capacity and role of resource sharing policies
Available online 23 February 2005.
Abstract
In this paper we model and study the performance of peer-to-peer (P2P) file sharing systems in terms of their ‘service capacity’. We identify two regimes of interest: the transient and stationary regimes. We show that in both regimes, the performance of P2P systems exhibits a favorable scaling with the offered load. P2P systems achieve this by efficiently leveraging the service capacity of other peers, who possibly are concurrently downloading the same file. Therefore to improve the performance, it is important to design mechanisms to give peers incentives for sharing/cooperation. One approach is to introduce mechanisms for resource allocation that are ‘fair’, such that a peer's performance improves with his contributions. We find that some intuitive ‘fairness’ notions may unexpectedly lead to ‘unfair’ allocations, which do not provide the right incentives for peers. Thus, implementation of P2P systems may want to compromise the degree of ‘fairness’ in favor of maintaining system robustness and reducing overheads.
Keywords: Peer-to-peer; File sharing; Service capacity; Incentive; Fairness
Article Outline
- 1. Introduction
- 2. Service capacity of P2P systems
- 2.1. Transient analysis of service capacity
- 2.1.1. Deterministic model
- 2.1.2. Branching process model
- 2.2. Stationary regime analysis of service capacity
- 2.3. Trace measurements
- 3. Fairness, incentives and their implications on performance
- 3.1. Notions of fairness in stationary regime
- 3.1.1. Global proportional fairness
- 3.1.2. Peerwise proportional fairness
- 3.1.3.
-Peerwise proportional fairness - 3.2. How to improve incentives under traffic dynamics?
- 4. Conclusion
- Appendix A. Appendix
- References
- Vitae






E-mail Article
Add to my Quick Links

Cited By in Scopus (8)







