Inferring Link Weights using End-to-End Measurements (2002)
Cached
Download Links
- [www.cs.washington.edu]
- [www.icir.org]
- [suraj.lums.edu.pk]
- [www.imconf.net]
- [www.cs.washington.edu]
- [research.microsoft.com]
- [www.cs.washington.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In ACM SIGCOMM Internet Measurement Workshop |
| Citations: | 82 - 14 self |
BibTeX
@INPROCEEDINGS{Mahajan02inferringlink,
author = {Ratul Mahajan and Neil Spring and David Wetherall and Tom Anderson},
title = {Inferring Link Weights using End-to-End Measurements},
booktitle = {In ACM SIGCOMM Internet Measurement Workshop},
year = {2002},
pages = {231--236}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
