|
Published Articles >> Table of Contents >> Abstract
12th IEEE International Conference on Network Protocols (ICNP'04)
pp. 316-325
Packet-Pair Bandwidth Estimation: Stochastic Analysis of a Single Congested Node
Seong-ryong Kang, Texas A&M University, College Station
Xiliang Liu, City University of New York
Min Dai, Texas A&M University, College Station
Dmitri Loguinov, Texas A&M University, College Station
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICNP.2004.1348121
Send link to a friend
| Abstract |
|
In this paper, we examine the problem of estimating the capacity of bottleneck links and available bandwidth of end-to-end paths under non-negligible cross-traffic conditions. We present a simple stochastic analysis of the problem in the context of a single congested node and derive several results that allow the construction of asymptotically-accurate bandwidth estimators. We first develop a generic queuing model of an Internet router and solve the estimation problem assuming renewal cross-traffic at the bottleneck link. Noticing that the renewal assumption on Internet flows is too strong, we investigate an alternative filtering solution that asymptotically converges to the desired values of the bottleneck capacity and available bandwidth under arbitrary (including non-stationary) cross-traffic. This is one of the first methods that simultaneously estimates both types of bandwidth and is provably accurate. We finish the paper by discussing the impossibility of a similar estimator for paths with two or more congested routers.
|
 Additional Information
|
Citation:
Seong-ryong Kang, Xiliang Liu, Min Dai, Dmitri Loguinov,
"Packet-Pair Bandwidth Estimation: Stochastic Analysis of a Single Congested Node,"
icnp,
pp. 316-325,
12th IEEE International Conference on Network Protocols (ICNP'04),
2004
|
|
