Concrete Math
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
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A simple reputation model for BitTorrent-like incentives
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Demand-aware content distribution on the internet
IEEE/ACM Transactions on Networking (TON)
On the stability and optimality of universal swarms
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Stability of a peer-to-peer communication system
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On the stability of two-chunk file-sharing systems
Queueing Systems: Theory and Applications
On the stability and optimality of universal swarms
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Peer-to-Peer multimedia sharing based on social norms
Image Communication
Content dynamics in P2P networks from queueing and fluid perspectives
Proceedings of the 24th International Teletraffic Congress
Rating Protocols in Online Communities
ACM Transactions on Economics and Computation
| Hi-index | 0.01 |
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 with an initial coupon provided by a bootstrap server, acquire other coupons from other users, and leave once they complete their coupon collection. For open systems, with exogenous user arrivals, we derive stability condition for 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 sojourn time in both systems is asymptotically optimal 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 Ngoes to infinity. We show that this size 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 leftovers is of order log(log(N)). These results suggest that, under the assumption that the bootstrap server is not a bottleneck, the performance does not depend critically on either altruistic user behavior or on load-balancing strategies such as rarest first.