Article

Free access

Measuring ISP topologies with rocketfuel

Authors:

David WetherallAuthors Info & Claims

SIGCOMM '02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications

Pages 133 - 145

https://doi.org/10.1145/633025.633039

Published: 19 August 2002 Publication History

Abstract

To date, realistic ISP topologies have not been accessible to the research community, leaving work that depends on topology on an uncertain footing. In this paper, we present new Internet mapping techniques that have enabled us to directly measure router-level ISP topologies. Our techniques reduce the number of required traces compared to a brute-force, all-to-all approach by three orders of magnitude without a significant loss in accuracy. They include the use of BGP routing tables to focus the measurements, exploiting properties of IP routing to eliminate redundant measurements, better alias resolution, and the use of DNS to divide each map into POPs and backbone. We collect maps from ten diverse ISPs using our techniques, and find that our maps are substantially more complete than those of earlier Internet mapping efforts. We also report on properties of these maps, including the size of POPs, distribution of router outdegree, and the inter-domain peering structure. As part of this work, we release our maps to the community.

References

[1]

P. Barford, A. Bestavros, J. Byers, and M. Crovella. On the Marginal Utility of Network Topology Measurements. In ACM SIGCOMM Internet Measurement Workshop, November 2001.]]

Digital Library

[2]

A. Basu and J. Riecke. Stability issues in OSPF routing. In ACM SIGCOMM, August 2001.]]

Digital Library

[3]

H. Burch and B. Cheswick. Mapping the Internet. IEEE Computer, 32(4):97--98, 102, 1999.]]

Digital Library

[4]

R. Bush. Private communication, November 2001.]]

[5]

H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. On Inferring AS-Level Connectivity from BGP Routing Tables. Technical Report UM-CSE-TR-454-02, 2002. http://topology.eecs.umich.edu/.]]

[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.]]

Digital Library

[8]

R. Govindan and H. Tangmunarunkit. Heuristics for Internet map discovery. In IEEE INFOCOM, 2000.]]

[9]

T. Kernen. traceroute.org. http://www.traceroute.org.]]

[10]

C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian. Delayed Internet Routing Convergence. In ACM SIGCOMM, September 2000.]]

Digital Library

[11]

R. Mahajan, S. M. Bellovin, S. Floyd, J. Ioannidis, V. Paxson, and S. Shenker. Controlling high-bandwidth aggregates in the network (extended version). http://www.aciri.org/pushback/, July 2001.]]

[12]

A. Medina, I. Matta, and J. Byers. BRITE: A flexible generator of Internet toplogies. Technical Report BU-CS-TR-2000-005, Boston University, 2000.]]

Digital Library

[13]

D. Meyer. RouteViews Project. http://www.routeviews.org.]]

[14]

V. N. Padmanabhan and L. Subramanian. An investigation of geographic mapping techniques for Internet hosts. In ACM SIGCOMM, August 2001.]]

Digital Library

[15]

J. Pansiot and D. Grad. On routes and multicast trees in the Internet. In ACM SIGCOMM Computer Communication Review, pages 41--50, 1997.]]

Digital Library

[16]

K. Park and H. Lee. On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets. In ACM SIGCOMM, August 2001.]]

Digital Library

[17]

G. Philips, S. Shenker, and H. Tangmunarunkit. Scaling of multicast trees: Comments on the Chuang-Sirbu scaling law. In ACM SIGCOMM, August 1999.]]

Digital Library

[18]

P. Radoslavov, H. Tangmunarunkit, H. Yu, R. Govindan, S. Shenker, and D. Estrin. On characterizing network topologies and analyzing their impact on protocol design. Technical Report CS-00-731, USC, 2000.]]

[19]

R. Rivest. The MD5 message-digest algorithm, 1992. Networking Working Group Requests for Comment, MIT Laboratory for Computer Science and RSA Data Security, Inc., RFC-1321.]]

Digital Library

[20]

Rocketfuel maps and data. http://www.cs.washington.edu/research/networking/rocketfuel/.]]

[21]

S. Savage, D. Wetherall, A. Karlin, and T. Anderson. Practical network support for IP traceback. In ACM SIGCOMM, August 2000.]]

Digital Library

[22]

A. C. Snoeren, C. Partridge, L. A. Sanchez, C. E. Jones, F. Tchakountio, S. T. Kent, and W. T. Strayer. Hash-based IP traceback. In ACM SIGCOMM, August 2001.]]

Digital Library

[23]

R. Sterner. Color landform atlas of the United States. http://fermi.jhuapl.edu/states/.]]

[24]

H. Tangmunarunkit, J. Doyle, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Does AS Size Determine Degree in AS Topology? In ACM Computer Communication Review. October 2001.]]

Digital Library

[25]

H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree-based vs structural. In ACM SIGCOMM, August 2002.]]

Digital Library

[26]

E. W. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internetwork. In Proceedings of IEEE INFOCOM, 1996.]]

Digital Library

Cited By

Thiagarajan KCarisimo EBustamante FSekar VYu MSeneviratne AVeitch D(2024)POSTER: Revealing Hidden Secrets: Decoding DNS PTR records with Large Language ModelsProceedings of the ACM SIGCOMM 2024 Conference: Posters and Demos10.1145/3672202.3673717(10-12)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3672202.3673717
Jiang NWang JWang JWang P(2023)TinyG: Accurate IP Geolocation Using a Tiny Number of Probers2023 19th International Conference on Network and Service Management (CNSM)10.23919/CNSM59352.2023.10327884(1-9)Online publication date: 30-Oct-2023
https://doi.org/10.23919/CNSM59352.2023.10327884
Xie TThakkar SHe TMcDaniel PBurke Q(2023)Joint Caching and Routing in Cache Networks With Arbitrary TopologyIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.327672434:8(2237-2250)Online publication date: Aug-2023
https://doi.org/10.1109/TPDS.2023.3276724
Show More Cited By

Index Terms

Measuring ISP topologies with rocketfuel
1. Networks
  1. Network properties
    1. Network structure

Recommendations

Measuring ISP topologies with rocketfuel
Proceedings of the 2002 SIGCOMM conference

To date, realistic ISP topologies have not been accessible to the research community, leaving work that depends on topology on an uncertain footing. In this paper, we present new Internet mapping techniques that have enabled us to directly measure ...
Measuring ISP topologies with rocketfuel

To date, realistic ISP topologies have not been accessible to the research community, leaving work that depends on topology on an uncertain footing. In this paper, we present new Internet mapping techniques that have enabled us to measure router-level ...
Designing optimal iBGP route-reflection topologies
NETWORKING'08: Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet

The Border Gateway Protocol (BGP) is used today by all Autonomous Systems (AS) in the Internet. Inside each AS, iBGP sessions distribute the external routes among the routers. In large ASs, relying on a full-mesh of iBGP sessions between routers is not ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications

August 2002

368 pages

ISBN:158113570X

DOI:10.1145/633025

Conference Chairs:
Matt Mathis
Pittsburgh Supercomputing Center
,
Peter Steenkiste
Carnegie Mellon University
,
Program Chairs:
Hari Balakrishnan
Massachusetts Institute of Technology
,
Vern Paxson
ICIR

ACM SIGCOMM Computer Communication Review Volume 32, Issue 4
Proceedings of the 2002 SIGCOMM conference
October 2002
332 pages
ISSN:0146-4833
DOI:10.1145/964725
Issue’s Table of Contents

Copyright © 2002 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 August 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCOMM02

Sponsor:

SIGCOMM02: SIGCOMM 2002 Conference

August 19 - 23, 2002

Pennsylvania, Pittsburgh, USA

Acceptance Rates

SIGCOMM '02 Paper Acceptance Rate 25 of 300 submissions, 8%;

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

952
Total Citations
View Citations
2,524
Total Downloads

Downloads (Last 12 months)315
Downloads (Last 6 weeks)23

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Thiagarajan KCarisimo EBustamante FSekar VYu MSeneviratne AVeitch D(2024)POSTER: Revealing Hidden Secrets: Decoding DNS PTR records with Large Language ModelsProceedings of the ACM SIGCOMM 2024 Conference: Posters and Demos10.1145/3672202.3673717(10-12)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3672202.3673717
Jiang NWang JWang JWang P(2023)TinyG: Accurate IP Geolocation Using a Tiny Number of Probers2023 19th International Conference on Network and Service Management (CNSM)10.23919/CNSM59352.2023.10327884(1-9)Online publication date: 30-Oct-2023
https://doi.org/10.23919/CNSM59352.2023.10327884
Xie TThakkar SHe TMcDaniel PBurke Q(2023)Joint Caching and Routing in Cache Networks With Arbitrary TopologyIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.327672434:8(2237-2250)Online publication date: Aug-2023
https://doi.org/10.1109/TPDS.2023.3276724
Ye MHu YZhang JGuo ZChao H(2023)Reinforcement Learning-based Traffic Engineering for QoS Provisioning and Load Balancing2023 IEEE/ACM 31st International Symposium on Quality of Service (IWQoS)10.1109/IWQoS57198.2023.10188762(1-10)Online publication date: 19-Jun-2023
https://doi.org/10.1109/IWQoS57198.2023.10188762
Lu JZhang PLiu Y(2023)A Vector Routing Protocol for Computing and Network Convergence in Digital Grid Scenario2023 7th International Conference on Computer, Software and Modeling (ICCSM)10.1109/ICCSM60247.2023.00015(30-36)Online publication date: 21-Jul-2023
https://doi.org/10.1109/ICCSM60247.2023.00015
Nur A(2023)Accuracy and Coverage Analysis of IP Geolocation Databases2023 International Balkan Conference on Communications and Networking (BalkanCom)10.1109/BalkanCom58402.2023.10167899(1-6)Online publication date: 5-Jun-2023
https://doi.org/10.1109/BalkanCom58402.2023.10167899
Gul HAl-Obeidat FAmin AMoreira FHuang K(2022)Hill Climbing-Based Efficient Model for Link Prediction in Undirected GraphsMathematics10.3390/math1022426510:22(4265)Online publication date: 15-Nov-2022
https://doi.org/10.3390/math10224265
Piraux MNavarre LRybowski NBonaventure ODonnet BBarakat CPelsser CBenson TChoffnes D(2022)Revealing the evolution of a cloud provider through its network weather mapProceedings of the 22nd ACM Internet Measurement Conference10.1145/3517745.3561462(298-304)Online publication date: 25-Oct-2022
https://dl.acm.org/doi/10.1145/3517745.3561462
Salamatian LAnderson SMatthews JBarford PWillinger WCrovella M(2022)Curvature-based Analysis of Network Connectivity in Private Backbone InfrastructuresProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35080256:1(1-32)Online publication date: 28-Feb-2022
https://dl.acm.org/doi/10.1145/3508025
Xu HXi PZhao GLiu JQian CHuang L(2022)SAFE-ME: Scalable and Flexible Policy Enforcement in Middlebox NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2022.316716930:5(2246-2261)Online publication date: Oct-2022
https://doi.org/10.1109/TNET.2022.3167169
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents