Publication View

Inferring Link Weights using End-to-End Measurements (2002)

Abstract

We describe a novel constraint-based approach to approximate ISP link weights using only end-to-end measurements. Common routing protocols such as OSPF and IS-IS choose least-cost paths using link weights, so inferred weights provide a simple, concise, and useful model of intradomain routing. Our approach extends router-level ISP maps, which include only connectivity, with link weights that are consistent with routing. Our inferred weights agree well with observed routing: while our inferred weights fully characterize the set of shortest paths between 84-99% of the router-pairs, alternative models based on hop count and latency do so for only 47-81% of the pairs.

Publication details

Download	http://citeseer.ist.psu.edu/536733.html
Source	http://www.cs.washington.edu/research/networking/rocketfuel/papers/imw2002.ps
Publisher	unknown
Contributors	The Pennsylvania State University CiteSeer Archives
Repository	CiteSeer (United States)
Keywords	Ratul Mahajan,Neil Spring,David Wetherall,Tom Anderson Inferring Link Weights using End-to-End Measurements
Language	Englisch
Relation	oai:CiteSeerPSU:94649, oai:CiteSeerPSU:12388, oai:CiteSeerPSU:671341, oai:CiteSeerPSU:219922, oai:CiteSeerPSU:267806, oai:CiteSeerPSU:499008, oai:CiteSeerPSU:235118, oai:CiteSeerPSU:472663, oai:CiteSeerPSU:445856, oai:CiteSeerPSU:610768, oai:CiteSeerPSU:217801, oai:CiteSeerPSU:694698, oai:CiteSeerPSU:509103, oai:CiteSeerPSU:462425

Publications citing this publication (1)

Shifting the link weights in networks (2006)