Service capacity of peer to peer networks

431 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Co-operative downloading in vehicular ad-hoc wireless networks (2005, methodology): “In short, the less local the traffic pattern, the faster per node capacity degrades with network size.”
Clustering and sharing incentives in BitTorrent systems (2006, background): “[23] study the service capacity of BitTorrent systems and show that it increases exponentially at the beginning of the torr ent, and scales well with the number of peers.”
Rarest first and choke algorithms are enough (2006, background): “startup, available pieces are replicated with an exponential capacity of service [26], but rare pieces are served by the initial seed at a constant rate.”
Measurements, analysis, and modeling of BitTorrent-like systems (2005, methodology): “Study [23] analyzes the service capacity of BitTorrent-like systems, and finds that multi-part downloading helps P2P systems to improve performance during flash crowd period.”
Improving Traffic Locality in BitTorrent via Biased Neighbor Selection (2006, background): “We believe that as the number of peers inside an ISP increases, rare pieces brought from outside get more time to replicate inside the ISP as 6 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS’06) 0-7695-2540-7/06 $20.00 © 2006 IEEE 0 10 20 30 40 50 60 70”