Laurent Massoulié
ABSTRACT
Motivated by the study of peer-to-peer file swarming systems à la BitTorrent, we introduce a probabilistic model of coupon replication systems. These systems consist of users, aiming to complete a collection of distinct coupons. Users are characterised by their current collection of coupons, and leave the system once they complete their coupon collection. The system evolution is then specified by describing how users of distinct types meet, and which coupons get replicated upon such encounters.For open systems, with exogenous user arrivals, we derive necessary and sufficient stability conditions in a layered scenario, where encounters are between users holding the same number of coupons. We also consider a system where encounters are between users chosen uniformly at random from the whole population. We show that performance, captured by sojourn time, is asymptotically optimal in both systems as the number of coupon types becomes large.We also consider closed systems with no exogenous user arrivals. In a special scenario where users have only one missing coupon, we evaluate the size of the population ultimately remaining in the system, as the initial number of users, N, goes to infinity. We show that this decreases geometrically with the number of coupons, K. In particular, when the ratio K/log(N) is above a critical threshold, we prove that this number of left-overs is of order log(log(N)).These results suggest that performance of file swarming systems does not depend critically on either altruistic user behavior, or on load balancing strategies such as rarest first.
- Edonkey. http://www.edonkey2000.com/index.html.Google Scholar
- Kazaa. http://www.kazaa.com/.Google Scholar
- A. Müller and D. Stoyan. Comparison Methods for Stochastic Models and Risks. Wiley Series in Probability and Statistics, 2002.Google Scholar
- N. Alon and J. Spencer. The probabilistic method. Wiley Interscience Series in Discrete Mathematics and Optimization, 2 edition, 2000.Google Scholar
- B. Cohen. Incentives Build Robustness in BitTorrent, http://bitconjurer.org/BitTorrent/bittorrentecon.pdf, May 2003.Google Scholar
- S. Deb and M. Médard. Algebraic Gossip: A Network Coding Approach to Optimal Multiple Rumor Mongering, April 2004. preprint.Google Scholar
- D. Qiu and R. Srikant. Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks. In Proc. of ACM Sigcomm 2004, Portland, Oregon, 2004. Google ScholarDigital Library
- G. Hardy, J. E. Littlewood, and G. Pólya. Inequalities. Cambridge Mathematical Library, 2 edition, 1952.Google Scholar
- R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison Wesley, 1998. Google ScholarDigital Library
- J. Hofbauer and K. Sigmund. Evolutionary Games and Population Dynamics. Cambridge University Press, 1998.Google ScholarCross Ref
- J. A. Pouwelse, P. Garbacki, D. H. J. Epema, and H. J. Sips. The BitTorrent P2P File-sharing System: Measurement and Analysis. In Proc. IPTPS'05, Feb 2005. Google ScholarDigital Library
- H. K. Khalil. Nonlinear Systems. Prentice Hall, 3 edition, 2002.Google Scholar
- T. Kurtz. Approximation of Population Processes, volume 36. CBMS-NSF Regional Conference Series in Applied Mathematics, 1981.Google ScholarCross Ref
- R. Loynes. The stability of a queue with non-independent inter-arrival and service times. Proc. of Cambr. Phil. Soc., 58(3):497--520, 1962.Google ScholarCross Ref
- M. Izal, G. Urvoy-Keller, E. W. Biersack, P. A. Felber, A. Al Hamra, and L. Garcés-Erice. Dissecting BitTorrent: Five Months in a Torrent's Life. In Proc. of PAM~2004, Antibes, France, 2004.Google ScholarCross Ref
- J. Mundinger and R. Weber. Efficient File Dissemination using Peer-to-Peer Technology. Tech. Rep. 2004-01, University of Cambridge, UK, 2004.Google Scholar
- X. Yang and G. de Veciana. Service Capacity of Peer to Peer Networks. In Proc. of Infocom 2004, Hong-Kong, China, 2004.Google ScholarCross Ref
Index Terms
- Coupon replication systems
Recommendations
Coupon replication systems
Motivated by the study of peer-to-peer file swarming systems à la BitTorrent, we introduce a probabilistic model of coupon replication systems. These systems consist of users aiming to complete a collection of distinct coupons. Users enter the system ...
Coupon replication systems
Performance evaluation reviewMotivated by the study of peer-to-peer file swarming systems à la BitTorrent, we introduce a probabilistic model of coupon replication systems. These systems consist of users, aiming to complete a collection of distinct coupons. Users are characterised ...
Bandwidth trading in BitTorrent-like P2P networks for content distribution
Bandwidth trading schemes give peers an incentive to provide upload bandwidth to other peers in a P2P network for fast file distribution. A popular example is the tit-for-tat strategy used in the BitTorrent protocol. Although this game theoretical ...
Comments