Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Convex Optimization
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
Incentives in BitTorrent induce free riding
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Drawing crowds and bit welfare
ACM SIGecom Exchanges
Performance of peer-to-peer networks: service capacity and role of resource sharing policies
Performance Evaluation - P2P computing systems
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)
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
Challenges, design and analysis of a large-scale p2p-vod system
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Do incentives build robustness in bit torrent
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
The bittorrent p2p file-sharing system: measurements and analysis
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Cooperation via contracts: stability and algorithms
INFOCOM'10 Proceedings of the 29th conference on Information communications
Structured overlay network for file distribution
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A simple model for chunk-scheduling strategies in P2P streaming
IEEE/ACM Transactions on Networking (TON)
Quantifying downloading performance of locality-aware bittorrent protocols
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
Price differentiation all-pay auction-based incentives in bittorrent
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
A detailed examination of the overlay construction and maintenance mechanism in BitTorrent
Computer Communications
Evaluating stranger policies in P2P file-sharing systems with reciprocity mechanisms
Computer Networks: The International Journal of Computer and Telecommunications Networking
International Journal of Communication Networks and Distributed Systems
Understand traffic locality of peer-to-peer video file swarming
Computer Communications
P2P group management systems: A conceptual analysis
ACM Computing Surveys (CSUR)
Modeling BitTorrent-like systems with many classes of users
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Future Generation Computer Systems
On the performance and fairness of BitTorrent-like data swarming systems with NAT devices
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
The BitTorrent (BT) file sharing protocol is very popular due to its scalability property and the built-in incentive mechanism to reduce free-riding. However, in designing such P2P file sharing protocols, there is a fundamental trade-off between keeping fairness and providing good performance. In particular, the system can either keep peers (especially those resourceful ones) in the system for as long as possible so as to help the system to achieve better performance, or allow more resourceful peers to finish their download as quickly as possible so as to achieve fairness. The current BT protocol represents only one possible implementation in this whole design space. The objective of this paper is to characterize the design space of BT-like protocols. The rationale for considering fairness in the P2P file sharing context is to use it as a measure of willingness to provide service. We show that there is a wide range of design choices, ranging from optimizing the performance of file download time, to optimizing the overall fairness measure. More importantly, we show that there is a simple and easily implementable design knob so that the system can operate at a particular point in the design space. We also discuss different algorithms, ranging from centralized to distributed, in realizing the design knob. Performance evaluations are carried out, both via simulation and network measurement, to quantify the merits and properties of the BT-like file sharing protocols.