Inferring link weights using end-to-end measurements
| Title | Inferring link weights using end-to-end measurements |
| Publication Type | Conference Papers |
| Year of Publication | 2002 |
| Authors | Mahajan R, Spring N, Wetherall D, Anderson T |
| Conference Name | Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment |
| Date Published | 2002/// |
| Publisher | ACM |
| Conference Location | New York, NY, USA |
| ISBN Number | 1-58113-603-X |
| 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. |
| URL | http://doi.acm.org/10.1145/637201.637237 |
| DOI | 10.1145/637201.637237 |