A faster distributed algorithm for computing maximal matchings deterministically
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Concrete Math
A game theoretic approach to provide incentive and service differentiation in P2P networks
Proceedings of the joint international conference on Measurement and modeling of computer systems
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
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A simple analytical framework to analyze search strategies in large-scale peer-to-peer networks
Performance Evaluation - Performance 2005
Can self-organizing P2P file distribution provide QoS guarantees?
ACM SIGOPS Operating Systems Review
Rarest first and choke algorithms are enough
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Incentive and service differentiation in P2P networks: a game theoretic approach
IEEE/ACM Transactions on Networking (TON)
The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
The bittorrent p2p file-sharing system: measurements and analysis
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer 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
A stochastic model for BitTorrent-like systems
ACM SIGMETRICS Performance Evaluation Review
The design trade-offs of BitTorrent-like file sharing protocols
IEEE/ACM Transactions on Networking (TON)
Optimal server scheduling in hybrid P2P networks
Performance Evaluation
Interest-Intended Piece Selection in BitTorrent-like peer-to-peer file sharing systems
Journal of Parallel and Distributed Computing
Evaluating stranger policies in P2P file-sharing systems with reciprocity mechanisms
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
File swarming (or file sharing) is one of the most important applications in P2P networks. In this paper, we propose a stochastic framework to analyze a file-swarming system under realistic setting: constraints in upload/download capacity, collaboration among peers and incentive for chunk exchange. We first extend the results in the coupon system [L. Massoulie, M. Vojnovic, Coupon replication systems, in: Proc. ACM SIGMETRICS, Banff, Alberta, Canada, 2005] by providing a tighter performance bound. Then we generalize the coupon system by considering peers with limited upload and download capacity. We illustrate the last-piece problem and show the effectiveness of using forward error-correction (FEC) code and/or multiple requests to improve the performance. Lastly, we propose a framework to analyze an incentive-based file-swarming system. The stochastic framework we propose can serve as a basis for other researchers to analyze and design more advanced features of file-swarming systems.