Using pathchar to estimate Internet link characteristics

Downey, Allen B.

Abstract

We evaluate pathchar, a tool that infers the characteristics of links along an Internet path (latency, bandwidth, queue delays). Looking at two example paths, we identify circumstances where pathchar is likely to succeed, and develop techniques to improve the accuracy of pathchars estimates and reduce the time it takes to generate them. The most successful of these techniques is a form of adaptive data collection that reduces the number of measurements pathchar needs by more than 90% for some links.

Keywords

latency
bandwidth
queue
delay
pathchar
measurment

Notes

This paper is not about network simulation, but about empirical measurements of network metrics (latency and bandwidth) using a public domain tool called pathchar. It is TCP/IP specific.

As such it provides useful data for building a test network, and as a comparison for simulation results.

The round trip time (rtt) of a packet from a to b is measured by sending packets to b and decrementing the time to live (ttl) value until the packet gets rejected by b, and a ICMP error message is returned. This is done for packets of all sizes.

rtt = queue_1 + (lat + packet_size/bw) + queue_2 + forward_time + queue_3 + (lat + error_size/bw) + queue_4

By sending enough packets, we assume that eventually some packets will pass with negligible queue times. forward_time is assumed to be negligible. error_size/bw is assumed to be negligible. So:

rtt = (lat + packet_size/bw) + lat

This gives practical measurements of bandwidth and latency.

Related Papers

Bibtex

 @inproceedings{downey_pathchar99,
 author      ="Allen B. Downey",
 title       ="Using pathchar to estimate Internet link characteristics",
 pages       ="241-250",
 volume      ="",
 booktitle   ="Proceedings of ACM SIGCOMM '99",
 year        ="1999",
 documentURL =""
}

Back to Intro By Author By Importance By Keyword By Title By Reference