TY - GEN
T1 - Estimating link capacity in high speed networks
AU - Chen, Ling Jyh
AU - Sun, Tony
AU - Lao, Li
AU - Yang, Guang
AU - Sanadidi, M. Y.
AU - Gerla, Mario
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33745905915&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33745905915&partnerID=8YFLogxK
U2 - 10.1007/11753810_9
DO - 10.1007/11753810_9
M3 - Conference contribution
AN - SCOPUS:33745905915
SN - 3540341927
SN - 9783540341925
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 98
EP - 109
BT - Networking 2006 - Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Com. Syst. - 5th Int. IFIP-TC6 Netw. Conf. Proc.
A2 - Boavida, Fernando
A2 - Monteiro, Edmundo
A2 - Plagemann, Thomas
A2 - Stiller, Burkhard
A2 - Westphal, Cedric
PB - Springer Verlag
T2 - 5th International IFIP-TC6 Networking Conference, Networking 2006
Y2 - 15 May 2006 through 19 May 2006
ER -