作者: Ling-Jyh Chen , Tony Sun , Li Lao , Guang Yang , M. Y. Sanadidi
DOI: 10.1007/11753810_9
关键词: The Internet 、 Computer science 、 Critical path method 、 Network planning and design 、 Internet access 、 Network packet 、 Simulation 、 Emulation 、 Network management 、 Real-time computing 、 Bottleneck
摘要: Knowledge of bottleneck capacity an Internet path is critical for efficient network design, management, and usage. With emerging high speed links, most traditional estimation techniques are limited in providing fast accurate estimations. In this paper, we propose a new technique, called PBProbe, to estimate links. PBProbe based on CapProbe; however, instead solely relying packet pairs, employs “packet bulk” technique adapts the bulk length order overcome well known problem with pair approaches, namely lack timer resolution. As result, not only preserves simplicity CapProbe, but it also correctly estimates link capacities within much larger range. Using analysis, evaluate various lengths configurations. We then perform emulation experiments verify accuracy The results show that consistently great majority test cases.