loading...
On Estimating Tight-Link Bandwidth Characteristics over Multi-Hop Paths
Lisboa, Portugal July 04-July 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCS.2006.5726th IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seong-Ryong Kang, Texas A&M University, College Station, TX
Xiliang Liu, City University of New York, New York, NY
Amit Bhati, Texas A&M University, College Station, TX
Dmitri Loguinov, Texas A&M University, College Station, TX
In this paper, we explore multi-hop bandwidth estimation assuming arbitrary cross-traffic at each node and develop a new probing method called Envelope that can asymptotically estimate not only the available bandwidth but also the raw capacity of the tight link. Envelope is based on a multi-link recursive extension of unbiased single-hop estimators proposed in the past (e.g., [14]) and a variation of the packet-cartouche technique [6]. Through extensive simulations, we evaluate Envelope in various network settings and cross-traffic conditions and find that it can measure tight-link bandwidth characteristics with accuracy that significantly surpasses that of the existing methods. We also find that Envelope can measure non-tight links in certain path and cross-traffic configurations.
Citation:
Seong-Ryong Kang, Xiliang Liu, Amit Bhati, Dmitri Loguinov, "On Estimating Tight-Link Bandwidth Characteristics over Multi-Hop Paths," icdcs, pp.55, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions