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
The bittorrent p2p file-sharing system: measurements and analysis
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Analysis of peer-to-peer file dissemination amongst users of different upload capacities
ACM SIGMETRICS Performance Evaluation Review
Flash crowd in a file sharing system based on random encounters
Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
Peer to peer networks for defense against internet worms
Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
Analysis of peer-to-peer file dissemination
ACM SIGMETRICS Performance Evaluation Review
Computer Networks: The International Journal of Computer and Telecommunications Networking
Measurements, analysis, and modeling of BitTorrent-like systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Clustering and sharing incentives in BitTorrent systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Stochastic analysis of file-swarming systems
Performance Evaluation
High-bandwidth data dissemination for large-scale distributed systems
ACM Transactions on Computer Systems (TOCS)
Building heterogeneous peer-to-peer networks: protocol and analysis
IEEE/ACM Transactions on Networking (TON)
A queueing system for modeling a file sharing principle
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analysis of bittorrent-like protocols for on-demand stored media streaming
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimizing the BitTorrent performance using an adaptive peer selection strategy
Future Generation Computer Systems
Bittorrent is an auction: analyzing and improving bittorrent's incentives
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
An Analytical Study of the Resource Diffusion in Non-homogeneous P2P Networks
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
On scalability of proximity-aware peer-to-peer streaming
Computer Communications
Network Control and Optimization
An Activeness-Based Seed Choking Algorithm for Enhancing BitTorrent's Robustness
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Peer-assisted online storage and distribution: modeling and server strategies
Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
Uplink allocation beyond choke/unchoke: or how to divide and conquer best
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
The design trade-offs of BitTorrent-like file sharing protocols
IEEE/ACM Transactions on Networking (TON)
Foundations and Trends® in Networking
Adding Trust to P2P Distribution of Paid Content
ISC '09 Proceedings of the 12th International Conference on Information Security
Modeling chunk availability in P2P swarming systems
ACM SIGMETRICS Performance Evaluation Review
Locality-awareness in BitTorrent-like P2P applications
IEEE Transactions on Multimedia - Special section on communities and media computing
Content availability and bundling in swarming systems
Proceedings of the 5th international conference on Emerging networking experiments and technologies
A Stable Random-Contact Algorithm for Peer-to-Peer File Sharing
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
On uncoordinated file distribution with non-altruistic downloaders
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Modeling priority-based incentive policies for peer-assisted content delivery systems
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Topological properties affect the power of network coding in decentralized broadcast
INFOCOM'10 Proceedings of the 29th conference on Information communications
Estimating self-sustainability in peer-to-peer swarming systems
Performance Evaluation
Optimal server scheduling in hybrid P2P networks
Performance Evaluation
Balancing throughput, robustness, and in-order delivery in P2P VoD
Proceedings of the 6th International COnference
A simple model for chunk-scheduling strategies in P2P streaming
IEEE/ACM Transactions on Networking (TON)
Do incentives build robustness in bit torrent
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
On the stability of two-chunk file-sharing systems
Queueing Systems: Theory and Applications
Design and evaluation of load balancing algorithms in P2P streaming protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
About the lifespan of peer to peer networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Analyzing the dynamics and resource usage of p2p file sharing by a spatio-temporal model
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
A detailed examination of the overlay construction and maintenance mechanism in BitTorrent
Computer Communications
How impatience affects the performance and scalability of P2P video-on-demand systems
ACM SIGMETRICS Performance Evaluation Review
A mathematical framework for analyzing adaptive incentive protocols in P2P networks
IEEE/ACM Transactions on Networking (TON)
Insights on media streaming progress using BitTorrent-like protocols for on-demand streaming
IEEE/ACM Transactions on Networking (TON)
Caching for BitTorrent-like P2P systems: a simple fluid model and its implications
IEEE/ACM Transactions on Networking (TON)
Stable and scalable universal swarms
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Stable and scalable universal swarms
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Content availability and bundling in swarming systems
IEEE/ACM Transactions on Networking (TON)
Predicting the impact of measures against P2P networks: transient behavior and phase transition
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
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.