Inferring Link Weights Using End-to-End Measurements

Proceedings of the 2nd Internet Measurement Workshop (IMW 2002)

Volumn , Issue , 2002, Pages 231-236

  Mahajan, Ratul ^a   Spring, Neil ^a   Wetherall, David ^a   Anderson, Tom ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK PROTOCOLS; PROBLEM SOLVING; ROUTERS; TOPOLOGY;

END-TO-END MEASUREMENTS;

INTERNET;

EID: 0141762468     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/637201.637237     Document Type: Conference Paper

References (24)

1. M. Berkelaar. lp_solve: linear programming code, ftp://ftp.ics. ele.tue.nl/pub/lp_solve/.
2. A. Borning, B. Freeman-Benson, and M. Wilson. Constraint hierarchies. Lisp and Symbolic Computation, 5(3), 1992.
3. H. Burch and B. Cheswick. Mapping the Internet. IEEE Computer, 32(4):97-98, 102, 1999.
4. D. Burton and L. Toint. On an instance of the inverse shortest paths problem. Mathematical Programming, 53, 1992.
5. R. L. Carter and M. E. Crovella. Measuring bottleneck link speed in packet-switched networks. Technical Report TR-96-006, Boston University Computer Science Department, 1996.
6. k. claffy, T. E. Monk, and D. McRobb. Internet tomography. In Nature, January 1999.
7. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In ACM SIGCOMM, 1999.
8. S. P. Fekete, W. Hochstättler, S. Kromberg, and C. Moll. The complexity of an inverse shortest path problem. Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 49, 1999.
9. B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In IEEE INFOCOM, 2000.
10. L. Gao. On inferring autonomous system relationships in the Internet. In IEEE Global Internet Symposium, 2000.
11. R. Govindan and H. Tangmunarunkit. Heuristics for Internet map discovery. In IEEE INFOCOM, 2000.
12. V. Jacobson. Pathchar. ftp://ftp.ee.lbl.gov/pathchar.
13. V. Jacobson. Traceroute. ftp://ftp.ee.lbl.gov/traceroute.tar.Z.
14. K. Lai and M. Baker. Nettimer: A tool for measuring bottleneck link bandwidth. In USITS, 2001.
15. K. G. Murty. Linear Programing. John Wiley & Sons, 1983.
16. V. N. Padmanabhan and L. Subramanian. An investigation of geographic mapping techniques for Internet hosts. In ACM SIGCOMM, 2001.
17. R. Rastogi, Y. Beribart, M. Garofalakis, and A. Kumar. Optimal configuration of OSPF aggregates. In IEEE INFOCOM, 2002.
18. S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson. The end-to-end effects of Internet path selection. In ACM SIGCOMM, 1999.
19. N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with Rocketfuel. In ACM SIGCOMM, 2002.
20. L. Subrmanian, S. Agarwal, J. Rexford, and R. H.Katz. Characterizing the Internet hierarchy from multiple vantage points. In IEEE INFOCOM, 2002.
21. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree-based vs. structural. In ACM SIGCOMM, 2002.
22. H. Tangmunarunkit, R. Govindan, and S. Shenker. Internet path inflation due to policy routing. In SPIE ITCom, 2001.
23. Y. Wang, Z. Wang, and L. Zhang. Internet traffic engineering without full mesh overlaying. In IEEE INFOCOM, 2001.
24. R. Wunderling. SoPlex: The sequential object-oriented simplex class library. http://www.zib.de/Optimization/Software/Soplex/soplex.php.