Measurement-based optimization techniques for bandwidth-demanding peer-to-peer systems

Ng, T. S. Eugene; Chu, Yang-hua; Rao, Sanjay; Sripanidkulchai, Kunwadee; Zhang, H.

doi:10.1109/infcom.2003.1209240

Cited by 74 publications

(51 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…That is because TCP throughput is affected by round-trip time, and then by choosing a path with high throughput, a short path is very likely to be chosen. Nevertheless, since the 10 kB TCP throughput does not have strong correlation with round-trip time [8], we do not expect significant improvement with TCP fair rate allocation.…”

Section: Relative Delay Penalty (Rdp)mentioning

confidence: 74%

See 1 more Smart Citation

Eliminating Bottlenecks in Overlay Multicast

Kim

Lam

2005

NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

Abstract. Recently many overlay multicast systems have been proposed due to the limited availability of IP multicast. Because they perform multicast forwarding without support from routers, data may be delivered multiple times over the same physical link, causing a bottleneck. This problem is more serious for applications demanding high bandwidth such as multimedia distribution. Although such bottlenecks can be removed by changing overlay topology, a naïve approach may create bottlenecks in other parts of the network. In this paper, We propose an algorithm that removes all bottlenecks caused by the redundant data delivery of overlay multicast, detecting such bottlenecks using a waveletbased technique we recently proposed. In a case where the source rate is constant and the available bandwidth of each link is not less than the source rate, our algorithm guarantees that every node receives at the full source rate. Simulation results show that even in a network with a dense receiver population, our algorithm finds a tree that satisfies all the receiving nodes while other heuristic-based approaches often fail.

show abstract

Section: Relative Delay Penalty (Rdp)mentioning

confidence: 74%

“…However, 10 kB TCP throughput does not have very strong correlation with available bandwidth. Taking into account that a path chosen using 10 kB TCP throughput provides only half of the bandwidth of the best path [8], we optimistically assume that the bandwidth estimation has maximum error of 20%.…”

Section: Discussionmentioning

confidence: 99%

Eliminating Bottlenecks in Overlay Multicast

Kim

Lam

2005

NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

show abstract

“…Besides file sharing, P2P overlays have also been deployed in distributed directory service [18,21], web cache [15], storage [9], and grid computation [1] etc. While early work on P2P systems has mainly focused on system design and traffic measurement [19,20,17], some recent research has emphasized performance analysis. In [13], a closed queueing system is used to model a general P2P file sharing system and basic insights on the stationary performance are provided.…”

Section: Relationship To Prior Workmentioning

confidence: 99%

Modeling and performance analysis of BitTorrent-like peer-to-peer networks

QiuDongyu

SrikantR.

2004

SIGCOMM Comput. Commun. Rev.

451

511

View full text Add to dashboard Cite

In this paper, we develop simple models to study the performance of BitTorrent, a second generation peerto-peer (P2P) application. We first present a simple fluid model and study the scalability, performance and efficiency of such a file-sharing mechanism. We then consider the built-in incentive mechanism of BitTorrent and study its effect on network performance. We also provide numerical results based on both simulations and real traces obtained from the Internet.

show abstract

“…Then, an obvious solution to the problem of minimizing the average download time is to find the peer with the maximum average capacity, i.e., to choose peer j with the average capacity c j (c j ≥ c i for all i), as the average download time T i over source peer i would be given by F/c i . We assume that each peer can find the service capacity of its source peers via packet-level measurements or short-term in-band probing [18].…”

Section: A Limitations Of Approach Via Average Service Capacitymentioning

confidence: 99%

Minimizing File Download Time in Stochastic Peer-to-Peer Networks

Chiu

Eun

2008

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-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.

show abstract

Measurement-based optimization techniques for bandwidth-demanding peer-to-peer systems

Cited by 74 publications

References 16 publications

Eliminating Bottlenecks in Overlay Multicast

Eliminating Bottlenecks in Overlay Multicast

Modeling and performance analysis of BitTorrent-like peer-to-peer networks

Minimizing File Download Time in Stochastic Peer-to-Peer Networks

Contact Info

Product

Resources

About