@TechReport{Sinha05a,
	author = 	"Rishi Sinha and Christos Papadopoulos and John Heidemann",
	title = 	"Fingerprinting Internet Paths using Packet Pair Dispersion",
	institution = 	"University of Southern California Computer Science Department",
	year = 		2005,
	sortdate = 		"2005-02-01",
	project = "ant, lander, imsc",
	jsubject = "spectral_network",
	number =	"06-876",
	month =		feb,
	jlocation =	"johnh: pafile",
	keywords =	"path fingerprinting, packet pair",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Sinha05a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Sinha05a.pdf",
	copyrightholder = "authors",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
Path fingerprinting is an essential component of applications that
distinguish among different network paths, including path selection in
overlay networks, multi-path routing, monitoring and diagnosis of
network problems, and developing a deeper understanding of network
behavior.  This paper proposes a new approach to Internet path
fingerprinting based on the distribution of end-to-end packet-pair
measurements.  This approach allows detection of busy link sharing
between two paths, even when those segments have low utilization and
are not the paths' bottlenecks.  While our fingerprints do not assure
physically disjoint paths (since that requires information external to
the network), they reflect the traffic and link characteristics of
intermediate links.  This methodology is therefore tolerant of opaque
clouds such as VPNs, VLANs, or MPLS (unlike traceroute).  Using
analysis and simulation we explore the network factors that affect the
fingerprints, and we introduce a simple method to compare them.
Through measurements of up to a year over 15 Internet paths, we show
that our fingerprints are both distinct and persistent over periods of
several months, making their collection and use for path selection
feasible.
",
}

{"_id":"GBsgyhq2nurrw7L9G","bibbaseid":"sinha-papadopoulos-heidemann-fingerprintinginternetpathsusingpacketpairdispersion-2005","author_short":["Sinha, R.","Papadopoulos, C.","Heidemann, J."],"bibdata":{"bibtype":"techreport","type":"techreport","author":[{"firstnames":["Rishi"],"propositions":[],"lastnames":["Sinha"],"suffixes":[]},{"firstnames":["Christos"],"propositions":[],"lastnames":["Papadopoulos"],"suffixes":[]},{"firstnames":["John"],"propositions":[],"lastnames":["Heidemann"],"suffixes":[]}],"title":"Fingerprinting Internet Paths using Packet Pair Dispersion","institution":"University of Southern California Computer Science Department","year":"2005","sortdate":"2005-02-01","project":"ant, lander, imsc","jsubject":"spectral_network","number":"06-876","month":"February","jlocation":"johnh: pafile","keywords":"path fingerprinting, packet pair","url":"https://ant.isi.edu/%7ejohnh/PAPERS/Sinha05a.html","pdfurl":"https://ant.isi.edu/%7ejohnh/PAPERS/Sinha05a.pdf","copyrightholder":"authors","myorganization":"USC/Information Sciences Institute","abstract":"Path fingerprinting is an essential component of applications that distinguish among different network paths, including path selection in overlay networks, multi-path routing, monitoring and diagnosis of network problems, and developing a deeper understanding of network behavior. This paper proposes a new approach to Internet path fingerprinting based on the distribution of end-to-end packet-pair measurements. This approach allows detection of busy link sharing between two paths, even when those segments have low utilization and are not the paths' bottlenecks. While our fingerprints do not assure physically disjoint paths (since that requires information external to the network), they reflect the traffic and link characteristics of intermediate links. This methodology is therefore tolerant of opaque clouds such as VPNs, VLANs, or MPLS (unlike traceroute). Using analysis and simulation we explore the network factors that affect the fingerprints, and we introduce a simple method to compare them. Through measurements of up to a year over 15 Internet paths, we show that our fingerprints are both distinct and persistent over periods of several months, making their collection and use for path selection feasible. ","bibtex":"@TechReport{Sinha05a,\n\tauthor = \t\"Rishi Sinha and Christos Papadopoulos and John Heidemann\",\n\ttitle = \t\"Fingerprinting Internet Paths using Packet Pair Dispersion\",\n\tinstitution = \t\"University of Southern California Computer Science Department\",\n\tyear = \t\t2005,\n\tsortdate = \t\t\"2005-02-01\",\n\tproject = \"ant, lander, imsc\",\n\tjsubject = \"spectral_network\",\n\tnumber =\t\"06-876\",\n\tmonth =\t\tfeb,\n\tjlocation =\t\"johnh: pafile\",\n\tkeywords =\t\"path fingerprinting, packet pair\",\n\turl =\t\t\"https://ant.isi.edu/%7ejohnh/PAPERS/Sinha05a.html\",\n\tpdfurl =\t\"https://ant.isi.edu/%7ejohnh/PAPERS/Sinha05a.pdf\",\n\tcopyrightholder = \"authors\",\n\tmyorganization =\t\"USC/Information Sciences Institute\",\n\tabstract = \"\nPath fingerprinting is an essential component of applications that\ndistinguish among different network paths, including path selection in\noverlay networks, multi-path routing, monitoring and diagnosis of\nnetwork problems, and developing a deeper understanding of network\nbehavior. This paper proposes a new approach to Internet path\nfingerprinting based on the distribution of end-to-end packet-pair\nmeasurements. This approach allows detection of busy link sharing\nbetween two paths, even when those segments have low utilization and\nare not the paths' bottlenecks. While our fingerprints do not assure\nphysically disjoint paths (since that requires information external to\nthe network), they reflect the traffic and link characteristics of\nintermediate links. This methodology is therefore tolerant of opaque\nclouds such as VPNs, VLANs, or MPLS (unlike traceroute). Using\nanalysis and simulation we explore the network factors that affect the\nfingerprints, and we introduce a simple method to compare them.\nThrough measurements of up to a year over 15 Internet paths, we show\nthat our fingerprints are both distinct and persistent over periods of\nseveral months, making their collection and use for path selection\nfeasible.\n\",\n}\n\n","author_short":["Sinha, R.","Papadopoulos, C.","Heidemann, J."],"bibbaseid":"sinha-papadopoulos-heidemann-fingerprintinginternetpathsusingpacketpairdispersion-2005","role":"author","urls":{"Paper":"https://ant.isi.edu/%7ejohnh/PAPERS/Sinha05a.html"},"keyword":["path fingerprinting","packet pair"],"metadata":{"authorlinks":{}}},"bibtype":"techreport","biburl":"https://bibbase.org/f/dHevizJoWEhWowz8q/johnh-2023-2.bib","dataSources":["YLyu3mj3xsBeoqiHK","fLZcDgNSoSuatv6aX","fxEParwu2ZfurScPY","7nuQvtHTqKrLmgu99"],"keywords":["path fingerprinting","packet pair"],"search_terms":["fingerprinting","internet","paths","using","packet","pair","dispersion","sinha","papadopoulos","heidemann"],"title":"Fingerprinting Internet Paths using Packet Pair Dispersion","year":2005}