Real-Time Measurement of End-to-End Available Bandwidth using Kalman Filtering

This paper presents a new method, BART (bandwidth available in real-time), for estimating the end-to-end available bandwidth over a network path. It estimates bandwidth quasi-continuously, in real-time. The method has also been implemented as a tool. It relies on self-induced congestion, and repeatedly samples the available bandwidth of the network path with sequences of probe packet pairs, sent at randomized rates. BART requires little computation in each iteration, is lightweight with respect to memory requirements, and adds only a small amount of probe traffic. The BART method uses Kalman filtering, which enables real-time estimation (a.k.a. tracking). It maintains a current estimate, which is incrementally improved with each new measurement of the inter-packet time separations in a sequence of probe packet pairs. The measurement model has a strong non-linearity, and would not at first sight be considered suitable for Kalman filtering, but we show how this non-linearity can be handled. BART may be tuned according to the specific needs of the measurement application, such as agility vs. stability of the estimate. We have tested an implementation of BART in a physical test network with carefully controlled cross traffic, with good accuracy and agreement. Test measurements have also been performed over the Internet. We compare the performance of BART with that of pathChirp, a state-of-the-art tool for measuring end-to-end available bandwidth in real-time

[1]  Martin Nilsson,et al.  Continuous monitoring of available bandwidth over a network path , 2004 .

[2]  Brian D. Noble,et al.  SANE: Stable Agile Network Estimation , 2000 .

[3]  Brian D. Noble,et al.  Mobile network estimation , 2001, MobiCom '01.

[4]  Srinivasan Keshav,et al.  A control-theoretic approach to flow control , 1991, SIGCOMM '91.

[5]  A. Pasztor,et al.  The packet size dependence of packet pair like methods , 2002, IEEE 2002 Tenth IEEE International Workshop on Quality of Service (Cat. No.02EX564).

[6]  Manish Jain,et al.  Pathload: A Measurement Tool for End-to-End Available Bandwidth , 2002 .

[7]  kc claffy,et al.  Bandwidth estimation: metrics, measurement techniques, and tools , 2003, IEEE Netw..

[8]  Manish Jain,et al.  End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput , 2002, SIGCOMM 2002.

[9]  Johan M Karlsson,et al.  Adjustment of the BART Kalman Filter to Improve Real-Time Estimation of End-to-End Available Bandwidth , 2005 .

[10]  Kimberly C. Claffy,et al.  Comparison of Public End-to-End Bandwidth Estimation Tools on High-Speed Links , 2005, PAM.

[11]  Greg Welch,et al.  An Introduction to Kalman Filter , 1995, SIGGRAPH 2001.

[12]  Mats Björkman,et al.  A new end-to-end probing and analysis method for estimating bandwidth bottlenecks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[13]  J. L. Roux An Introduction to the Kalman Filter , 2003 .

[14]  Richard G. Baraniuk,et al.  pathChirp: Efficient available bandwidth estimation for network paths , 2003 .

[15]  Srinivasan Keshav A control-theoretic approach to flow control , 1991, SIGCOMM 1991.

[16]  Dmitri Loguinov,et al.  Multi-hop probing asymptotics in available bandwidth estimation: stochastic analysis , 2005, IMC '05.

[17]  Karl Henrik Johansson,et al.  Estimation of RTT and bandwidth for congestion Control Applications in Communication Networks , 2004 .