IEEE/ACM Transactions on Networking · 2008 · 30 citations · 28 references
ComputingComputer ScienceComputer SystemsComputer NetworksDistributed SystemsQueuing TheoryCommunication NetworksCongestion ControlNetwork Performance AnalysisPeer-to-peer NetworksPeer-to-peer SystemsQueueing TheoryBandwidthFile Sharing SystemsNetwork CapacityNetwork Congestion ModelingService Capacity MeasurementTemporal Fluctuation
The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet's bandwidth usage. Measurement studies show that a typical download of a file can take from minutes up to several hours depending on the level of network congestion or the service capacity fluctuation. In this paper, we consider two major factors that have significant impact on average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuation in service capacity of a single source peer. We point out that the common approach of analyzing the average download time based on average service capacity is fundamentally flawed. We rigorously prove that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then analyze a simple, distributed algorithm to effectively remove these negative factors, thus minimizing the average download time. We show through analysis and simulations that it outperforms most of other algorithms currently used in practice under various network configurations.
28
Ion Stoica, Robert Morris, David R. Karger et al. · 2001 · 9.7K citations
A scalable content-addressable network
Sylvia Ratnasamy, Paul Francis, Mark Handley et al. · 2001 · 6.4K citations · Full text
Incentives Build Robustness in Bit-Torrent
Bram Cohen · 2003 · 2.7K citations
Ion Stoica, Robert Morris, David R. Karger et al. · ACM SIGCOMM Computer Communication Review · 2001 · 1.9K citations