ICN 2001: Networking — ICN 2001 pp 753-761 | Cite as
An Algorithm for Available Bandwidth Measurement
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.
Keywords
Packet Size Accuracy Requirement Variable Speed Bandwidth Requirement Network CongestionPreview
Unable to display preview. Download preview PDF.
References
- 1.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.Google Scholar
- 2.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.Google Scholar
- 3.Carter, Robert L. and Mark E. Crovella, “Measuring Bottleneck Link Speed in Packet-Switched Networks,” Technical Report BU-CS-96-006, Boston University, 1996.Google Scholar
- 4.Downey, Allen B., “Using pathchar to Estimate Internet Link Characteristics,” in Proc. ACM SIGCOMM’99, 1999.Google Scholar
- 5.Jacobson, Van, pathchar, ftp://ftp.ee.lbl.gov/pathchar/, April 1997.Google Scholar