2006 · 381 citations · 14 references
ComputingComputer ScienceComputer SystemsComputer NetworksDigital CommunicationDistributed SystemsCachingData LocalityData Locality OptimizationPeer-to-peer NetworkingPeer-to-peer NetworksPeer-to-peer SystemsBandwidthPeer-to-peer ComputingReplication StrategiesSpatial Locality
Peer-to-peer (P2P) applications such as BitTorrent ignore traffic costs at ISPs and generate a large amount of cross-ISP traffic. As a result, ISPs often throttle BitTorrent traffic to control the cost. In this paper, we examine a new approach to enhance BitTorrent traffic locality, biased neighbor selection, in which a peer chooses the majority, but not all, of its neighbors from peers within the same ISP. Using simulations, we show that biased neighbor selection maintains the nearly optimal performance of Bit- Torrent in a variety of environments, and fundamentally reduces the cross-ISP traffic by eliminating the traffic’s linear growth with the number of peers. Key to its performance is the rarest first piece replication algorithm used by Bit- Torrent clients. Compared with existing locality-enhancing approaches such as bandwidth limiting, gateway peers, and caching, biased neighbor selection requires no dedicated servers and scales to a large number of BitTorrent networks.
14
Incentives Build Robustness in Bit-Torrent
Bram Cohen · 2003 · 2.7K citations
A case for end system multicast
Sanjay Rao · IEEE Journal on Selected Areas in Communications · 2002 · 1.5K citations
Network coding for large scale content distribution
Christos Gkantsidis, Pablo Rodríguez · 2005 · 1.1K citations
Distributing streaming media content using cooperative networking
Venkata N. Padmanabhan, Helen J. Wang, Philip A. Chou et al. · 2002 · 815 citations