An algorithm for available bandwidth measurement

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

He, J., Edward Chow, C., Yang, J., & Chujo, T. (2001). An algorithm for available bandwidth measurement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2093, pp. 753–761). Springer Verlag. https://doi.org/10.1007/3-540-47728-4_74

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free