Abstract
In this paper, we present an algorithm for available bandwidth measurement of a path between two hosts as well as some preliminary simulation results. The measurement algorithm is based on active probing with two techniques we have developed: variable speed probing and zoom-in/zoomout. Compared with previous work, the algorithm has the advantage of low overhead and fast convergence because it relies on the detection of traffic trends (with variable speed probing) rather than any specific properties of probing samples. The measurement can self-adapt to any bandwidth ranges (with zoomout) and respond to accuracy requirements (with zoom-in). Therefore, no knowledge about the bottleneck bandwidth of the measured path is required. We are currently experimenting with self-similar traffic over a real network environment to gain more experience and to further validate and improve the measurement techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adachi, Motomitsu, Shinji Kikuchi and Tsuneo Katsuyama, “NEPRI: Available Bandwidth Measurement in IP Networks,” Proc. 2000 IEEE International Conference on Communications, New Orleans, LA, June 2000.
Bolot, Jean-Chrysostome, “Characterizing End-to-End Packet Delay and Loss in the Internet,” Journal of High Speed Networks, vol. 2, No. 3, December 1993, pp.305–323.
Carter, Robert L. and Mark E. Crovella, “Measuring Bottleneck Link Speed in Packet-Switched Networks,” Technical Report BU-CS-96-006, Boston University, 1996.
Downey, Allen B., “Using pathchar to Estimate Internet Link Characteristics,” in Proc. ACM SIGCOMM’99, 1999.
Jacobson, Van, pathchar, ftp://ftp.ee.lbl.gov/pathchar/, April 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, J., Chow, C.E., Yang, J., Chujo, T. (2001). An Algorithm for Available Bandwidth Measurement. In: Lorenz, P. (eds) Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47728-4_74
Download citation
DOI: https://doi.org/10.1007/3-540-47728-4_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42302-7
Online ISBN: 978-3-540-47728-0
eBook Packages: Springer Book Archive