Estimating link capacity in high speed networks

  • Authors:
  • Ling-Jyh Chen;Tony Sun;Li Lao;Guang Yang;M. Y. Sanadidi;Mario Gerla

  • Affiliations:
  • Institute of Information Science, Academia Sinica, Taipei, Taiwan;Department of Computer Science, UCLA, Los Angeles, CA;Department of Computer Science, UCLA, Los Angeles, CA;Department of Computer Science, UCLA, Los Angeles, CA;Department of Computer Science, UCLA, Los Angeles, CA;Department of Computer Science, UCLA, Los Angeles, CA

  • Venue:
  • NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Knowledge of bottleneck capacity of an Internet path is critical for efficient network design, management, and usage. With emerging high speed Internet links, most traditional estimation techniques are limited in providing fast and accurate capacity estimations. In this paper, we propose a new technique, called PBProbe, to estimate high speed links. PBProbe is based on CapProbe; however, instead of solely relying on packet pairs, PBProbe employs a “packet bulk” technique and adapts the bulk length in order to overcome the well known problem with packet pair based approaches, namely the lack of accurate timer resolution. As a result, PBProbe not only preserves the simplicity and speed of CapProbe, but it also correctly estimates link capacities within a much larger range. Using analysis, we evaluate PBProbe with various bulk lengths and network configurations. We then perform emulation and Internet experiments to verify the accuracy and speed of PBProbe on high speed links. The results show that PBProbe is consistently fast and accurate in the great majority of test cases.