Overview

Pathneck is an active probing tool that can detect bottleneck location of network path. It only needs single end control, and has relatively small probing overhead (33.6KB for one probing in the default setting). See our papers and talk slides for more details. The Recursive Packet Train (RPT) is illustrated in the following figure:

measurement packets				load packets					measurement packets
1	2	..	30	255	255	...	255	255	30	..	2	1
30 packets 60B/pkt				60 packets, 500B/pkt					30 packets 60B/pkt
Recursive Packet Train (RPT). [ The number in each packet is the TTL value. ]

Papers

Optimizing Network Performance in Replicated Hosting.
Ningning Hu, Oliver Spatscheck, Jia Wang, and Peter Steenkiste.
In the Tenth International Workshop on Web Caching and Content Distribution (WCW 2005), Sophia Antipolis, French Riviera, France, September 2005.

A Measurement Study of Internet Bottlenecks.
Ningning Hu, Li Erran Li, Zhuoqing Morley Mao, Peter Steenkiste, Jia Wang.
In INFOCOM 2005 (slides: ppt).

Locating Internet Bottlenecks: Algorithms, Measurements, and Implications
Ningning Hu, Li Erran Li, Zhuoqing Morley Mao, Peter Steenkiste, Jia Wang.
In SIGCOMM 2004 (slides: ppt).

(An ealier version for part of this paper is in Technical Report CMU-CS-03-218: Ningning Hu, Peter Steenkiste. RPT: A Low Overhead Single-End Probing Tool for Detecting Network Congestion Positions).

Source Download

[ All the following versions are open source under GPL, and need root permission to run. ]

Pathneck 1.3

Pathneck 1.2

Source code: pathneck-1.2.tgz

Have been compiled successfully on Linux, FreeBSD, Sun, and MAC

ChangeLog
README

Pathneck 1.1

Source code: pathneck-1.1.tgz

People

Ningning Hu & Peter Steenkiste (CMU)
Li Erran Li (Bell Lab)
Zhuoqing Morley Mao (University of Michigan)
Jia Wang (AT&T Labs Research)

Contact

Please send bug reports to Ningning Hu (hnn@cs.cmu.edu)

[Last Updated On: Wed May 3 16:26:23 EDT 2006]