Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
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
Improving Traffic Locality in BitTorrent via Biased Neighbor Selection
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Rarest first and choke algorithms are enough
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Maintaining high bandwidth under dynamic network conditions
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
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
A Multiphased Approach for Modeling and Analysis of the BitTorrent Protocol
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Towards efficient data distribution on computational desktop grids with BitTorrent
Future Generation Computer Systems
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
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
A Partition-Based Broadcast Algorithm over DHT for Large-Scale Computing Infrastructures
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Context reasoning using extended evidence theory in pervasive computing environments
Future Generation Computer Systems
DHT-based lightweight broadcast algorithms in large-scale computing infrastructures
Future Generation Computer Systems
Fast file dissemination in peer-to-peer networks with upstream bandwidth constraint
Future Generation Computer Systems
Resisting free-riding behavior in BitTorrent
Future Generation Computer Systems
Optimizing peer selection in BitTorrent networks with genetic algorithms
Future Generation Computer Systems
An approach to peer selection in service overlays
Proceedings of the 7th International Conference on Network and Services Management
Peer selection in p2p service overlays using geographical location criteria
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part II
Hi-index | 0.00 |
BitTorrent employs a static quota-based peer selection strategy to fixedly allocate upload quotas for the Tit-For-Tat (TFT) choke algorithm and Optimistic Unchoke (OU) algorithm. This static quota allocation scheme would incur a paradox of supply and demand between upload peers and request peers. The paradox of supply and demand means that many request peers stay in the starvation state while many upload quotas stay in the idleness state. We propose a dynamic quota-based peer selection strategy, where request peers are classified by the principle of investment return and each upload peer adaptively allocates upload quotas for the TFT and OU algorithms according to dynamically changed numbers of different request peers. Simulation experiments show that our dynamic quota allocation scheme can eliminate the paradox of supply and demand, increase the resource utility ratio of upload peers, and decrease the file download time, at the cost of uploading more a few file blocks for each upload peer.