TY - CONF T1 - Inferring link weights using end-to-end measurements T2 - Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment Y1 - 2002 A1 - Mahajan,Ratul A1 - Spring, Neil A1 - Wetherall,David A1 - Anderson,Tom AB - 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. JA - Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment T3 - IMW '02 PB - ACM CY - New York, NY, USA SN - 1-58113-603-X UR - http://doi.acm.org/10.1145/637201.637237 M3 - 10.1145/637201.637237 ER -