Regression-Based Available Bandwidth Measurements

In this paper we present a method for estimating the available bandwidth of a network path. It is an extension and enhancement of the bandwidth measurement method TOPP. TOPP actively probes a network path by sending probe packets in a predetermined time pattern. Our enhancement involves a formalized estimation algorithm based on constrained linear regression. Using the algorithm, bandwidth measurements can be fully automated requiring no assistance from the user. We show that our method is able to estimate bottlenecks that cannot be detected by packet train methods such as C-probe. In addition to inferring the available bandwidth, the method gives an estimate of the link bandwidth of the most congested link on the network path. The link bandwidth estimates are not limited to the rate at which we can inject probe packets into the network.

[1]  Richard J. Gibbens,et al.  Distributed connection acceptance control for a connectionless network , 1999 .

[2]  D A Williams.  Discrimination between regression models to determine the pattern of enzyme synthesis in synchronous cell cultures. , 1970, Biometrics.

[3]  Van Jacobson,et al.  A tool to infer characteristics of internet paths , 1997 .

[4]  Mary Baker,et al.  Measuring bandwidth , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Mark Crovella,et al.  Measuring Bottleneck Link Speed in Packet-Switched Networks , 1996, Perform. Evaluation.

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

[7]  Mats Björkman,et al.  Impact of the Ethernet Capture Effect on Bandwidth Measurements , 2000, NETWORKING.

[8]  D. Hudson.  Fitting Segmented Curves Whose Join Points Have to Be Estimated , 1966 .

[9]  Williams Da,et al.  Discrimination between regression models to determine the pattern of enzyme synthesis in synchronous cell cultures. , 1970 .

[10]  Parameswaran Ramanathan,et al.  What do packet dispersion techniques measure? , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Janey C. Hoe.  Improving the start-up behavior of a congestion control scheme for TCP , 1996, SIGCOMM 1996.

[12]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[13]  Mary Baker,et al.  Measuring link bandwidths using a deterministic model of packet delay , 2000, SIGCOMM.

[14]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[15]  J. Miller.  Numerical Analysis , 1966, Nature.

[16]  Ren Wang,et al.  TCP westwood: Bandwidth estimation for enhanced transport over wireless links , 2001, MobiCom '01.

[17]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[18]  George A. F. Seber,et al.  Linear regression analysis , 1977 .

[19]  Vern Paxson,et al.  On estimating end-to-end network path properties , 2001, SIGCOMM LA '01.

[20]  Allen B. Downey.  Using pathchar to estimate Internet link characteristics , 1999, SIGCOMM '99.

[21]  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).

[22]  Vern Paxson,et al.  Measurements and analysis of end-to-end Internet dynamics , 1997 .

[23]  Helmut Küchenhoff.  An Exact Algorithm for Estimating Breakpoints in Segmented Generalized Linear Models , 1997 .