@conference {17539,
	title = {Inferring link weights using end-to-end measurements},
	booktitle = {Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment},
	series = {IMW {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {231 - 236},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	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.},
	isbn = {1-58113-603-X},
	doi = {10.1145/637201.637237},
	url = {http://doi.acm.org/10.1145/637201.637237},
	author = {Mahajan,Ratul and Spring, Neil and Wetherall,David and Anderson,Tom}
}
