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 pathchar's 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. 1 Introduction pathchar is a new tool, written by Van Jacobson at Lawrence Berkeley Laboratory (LBL), that tries to infer the characteristics of individual links along an Internet path by measuring the round trip time of packets sent from a single host. An alpha version of pathchar is available for FreeBSD, Linux, OSF and Solaris from ftp://ftp.ee.lbl.gov/pathchar/. We explain the basic mechanism and evaluate its accuracy on two paths whose link characteristics are known. Based on thes...

Citations

524	End-to-end routing behavior in the Internet - Paxson - 1997
217	Dynamically forecasting network performance using the network weather service - Wolski - 1998
174	Empirically-derived analytic models of wide-area TCP connections - Paxson - 1998
58	Continuous Univariate Distributions–1 - Johnson, Kotz - 1970
30	Pathchar: a Tool to Infer Characteristics of Internet Paths - Jacobson - 1997