An Algorithm for Available Bandwidth Measurement
暂无分享,去创建一个
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.
[1] Tsuneo Katsuyama,et al. NEPRI: available bandwidth measurement in IP networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.
[2] Mark Crovella,et al. Measuring Bottleneck Link Speed in Packet-Switched Networks , 1996, Perform. Evaluation.
[3] Jean-Chrysostome Bolot,et al. Characterizing End-to-End Packet Delay and Loss in the Internet , 1993, J. High Speed Networks.