Ratul Mahajan, Neil Spring, David Wetherall, Tom Anderson  Home/Search
Context Related
| washington.edu/research/ne...imw2002.ps icir.org/vern/imw2002/imw200...213.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: washington.edu/homes/nspring/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
An Empirical Study of Routing Bias in Variable-Degree Networks - Shudong Jin Department (Correct)
Small-World Characteristics of Internet Topologies and.. - Jin, Bestavros (Correct)
USENIX Association - Usits Th Usenix (1992) (Correct)
Active bibliography (related documents): More All
0.6: Quantifying the Causes of Path Inflation - Neil Spring Ratul (2003) (Correct)
0.1: Measuring ISP Topologies with Rocketfuel - Neil Spring Ratul (2002) (Correct)
0.0: Network Topology Generators: Degree-Based vs. Structural - Tangmunarunkit.. (2002) (Correct)
Similar documents based on text: More All
0.4: User-level Internet Path Diagnosis - Ratul Mahajan Neil (2003) (Correct)
0.4: Scriptroute: A Public Internet Measurement Facility - Neil Spring David (2002) (Correct)
0.3: Dynamic Optimization of OSPF Weights using Online.. - Ye, Kaur.. (2002) (Correct)
Related documents from co-citation: More All
17: Measuring ISP Topologies with Rocketfuel - Spring, Mahajan et al. - 2002
12: Heuristics for Internet Map Discovery - Govindan, Tangmunarunkit - 2000
7: Network topology generators: Degree-based vs structural - Tangmunarunkit, Govindan et al. - 2002
BibTeX entry: (Update)
R. Mahajan, N. Spring, D. Wetherall, and T. Anderson. Inferring link weights using end-to-end measurements. In ACM SIGCOMM Internet Measurement Workshop, 2002. http://citeseer.ist.psu.edu/mahajan02inferring.html More
@misc{ mahajan02inferring,
author = "R. Mahajan and N. Spring and D. Wetherall and T. Anderson",
title = "Inferring link weights using end-to-end measurements",
text = "R. Mahajan, N. Spring, D. Wetherall, and T. Anderson. Inferring link weights
using end-to-end measurements. In ACM SIGCOMM Internet Measurement Workshop,
2002.",
year = "2002",
url = "citeseer.ist.psu.edu/mahajan02inferring.html" }
Citations (may not include all citations):375 On power-law relationships of the Internet topology - Faloutsos, Faloutsos et al. - 1999
167 Measuring bottleneck link speed in packet-switched networks - Carter, Crovella - 1996
166 Heuristics for Internet map discovery - Govindan, Tangmunarunkit - 2000
134 The end-to-end effects of Internet path selection - Savage, Collins et al. - 1999
117 Measuring ISP topologies with Rocketfuel - Spring, Mahajan et al. - 2002
101 Internet traffic engineering by optimizing OSPF weights - Fortz, Thorup - 2000
100 On inferring autonomous system relationships in the Internet - Gao - 2000
96 Lisp and Symbolic Computation (context) - Borning, Freeman-Benson et al. - 1992
90 Characterizing the Internet hierarchy from multiple vantage .. - Subrmanian, Agarwal et al. - 2002
74 Nettimer: A tool for measuring bottleneck link bandwidth - Lai, Baker - 2001
66 An investigation of geographic mapping techniques for Intern.. - Padmanabhan, Subramanian - 2001
39 Mapping the Internet (context) - Burch, Cheswick - 1999
30 Internet traffic engineering without full mesh overlaying (context) - Wang, Wang et al. - 2001
29 Network topology generators: Degree-based vs (context) - Tangmunarunkit, Govindan et al. - 2002
27 Internet path inflation due to policy routing - Tangmunarunkit, Govindan et al. - 2001
22 Internet tomography (context) - claffy, Monk et al. - 1999
11 an instance of the inverse shortest paths problem - Burton, Toint - 1992
2 Linear Programing (context) - Murty - 1983
1 Optimal configuration of OSPF aggregates - Rastogi, Beribart et al. - 2002
1 The complexity of an inverse shortest path problem - Fekete, attler et al. - 1999
ftp://ftp.ee.lbl.gov/pathchar
http://www.zib.de/Optimization/Software/Soplex/
ftp://ftp.ics
ftp://ftp.ee.lbl.gov/traceroute.tar.Z
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.washington.edu/homes/nspring/): More
Implementing a Performance Forecasting System for.. - Wolski, Spring, Peterson (1997) (Correct)
Predicting the CPU Availability of Time-shared Unix.. - Wolski, Spring, Hayes (1998) (Correct)
A Protocol-Independent Technique for Eliminating Redundant.. - Spring, Wetherall (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC