skip to main content
10.1145/1402958.1402993acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Free access

Discarte: a disjunctive internet cartographer

Published: 17 August 2008 Publication History

Abstract

Internet topology discovery consists of inferring the inter-router connectivity ("links") and the mapping from IP addresses to routers ("alias resolution"). Current topology discovery techniques use TTL-limited "traceroute" probes to discover links and use direct router probing to resolve aliases. The often-ignored record route (RR) IP option provides a source of disparate topology data that could augment existing techniques, but it is difficult to properly align with traceroute-based topologies because router RR implementations are under-standardized. Correctly aligned RR and traceroute topologies have fewer false links, include anonymous and hidden routers, and discover aliases for routers that do not respond to direct probing. More accurate and feature-rich topologies benefit overlay construction and network diagnostics, modeling, and measurement.
We present DisCarte, a system for aligning and cross-validating RR and traceroute topology data using observed engineering practices DisCarte uses disjunctive logic programming (DLP), a logical inference and constraint solving technique, to intelligently merge RR and traceroute data. We demonstrate that the resultant topology is more accurate and complete than previous techniques by validating its internal consistency and by comparing to publicly-available topologies. We classify irregularities in router implementations and introduce a divide-and-conquer technique used to scale DLP to Internet-sized systems.

References

[1]
Abilene router configurations. http://pea.grnoc.iu.edu/Abilene.
[2]
D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. Resilient overlay networks. In SOSP, 2001.
[3]
B. Augustin, et al. Avoiding traceroute anomalies with Paris traceroute. In IMC, 2006.
[4]
R. P. Bonica, D.-H. Gan, and D. C. Tappan. ICMP extensions for multiprotocol label switching. Internet Draft (work in progress): draft-ietf-mpls-icmp-05, 2006.
[5]
F. Calimeri, W. Faber, N. Leone, and G. Pfeifer. Pruning operators for disjunctive logic programming systems. Fundamenta Informaticae, 71(2-3):183--214, 2006.
[6]
Personal e-mail from Cisco engineers.
[7]
k. claffy, T. E. Monk, and D. McRobb. Internet tomography. Nature, Web Matters, 1999. http://www.nature.com/nature/webmatters/tomog/tomog.html.
[8]
http://www.dbai.tuwien.ac.at/proj/dlv/examples/3col.
[9]
M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In ACM SIGCOMM, 1999.
[10]
L. Gao and F. Wang. The extent of AS path inflation by routing policies. In IEEE GLOBECOM, vol. 3, 2002.
[11]
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
[12]
R. Govindan and H. Tangmunarunkit. Heuristics for Internet map discovery. In INFOCOM, 2000.
[13]
Graphviz. http://www.graphviz.org.
[14]
M. H. Gunes and K. Sarac. Analytical IP alias resolution. In IEEE International Conference on Communications (ICC), 2006.
[15]
N. Hu, O. Spatscheck, J. Wang, and P. Steenkiste. Locating Internet bottlenecks: Algorithms, measurements, and implications. In ACM SIGCOMM, 2004.
[16]
C. Jin, Q. Chen, and S. Jamin. Inet: Internet topology generator. Tech. Rep. CSE-TR-433-00, University of Michigan, EECS dept., 2000. http://topology.eecs.umich.edu/inet/inet-2.0.pdf.
[17]
E. Katz-Bassett, phet al. Towards IP geolocation using delay and topology measurements. In IMC, 2006.
[18]
A. Lakhina, J. Byers, M. Crovella, and P. Xie. Sampling biases in IP topology measurements. In INFOCOM, 2003.
[19]
N. Leone, phet al. The DLV system for knowledge representation and reasoning. ACM Trans. Computational Logic, 7(3):499--562, 2006.
[20]
M. Litzkow, M. Livny, and M. Mutka. Condor: A hunter of idle workstations. In ICDCS, 1988.
[21]
H. V. Madhyastha, et al. iPlane: An information plane for distributed services. In OSDI, 2006.
[22]
P. Mahadevan, D. Kriokov, K. Fall, and A. Vahdat. Systematic topology analysis and generation using degree correlations. In SIGCOMM, 2006.
[23]
R. Mahajan, N. Spring, D. Wetherall, and T. Anderson. Inferring link weights using end-to-end measurements. In IMW, 2002.
[24]
Z. M. Mao, J. Rexford, J. Wang, and R. Katz. Towards an accurate AS-level traceroute tool. In ACM SIGCOMM, 2003.
[25]
A. Medina, I. Matta, and J. Byers. BRITE: A flexible generator of Internet toplogies. Tech. Rep. BU-CS-TR-2000-005, Boston University, 2000.
[26]
D. Meyer. University of Oregon Route Views project. http://www.routeviews.org/.
[27]
A. Nakao, L. Peterson, and A. Bavier. A routing underlay for overlay networks. In ACM SIGCOMM, 2003.
[28]
V. N. Padmanabhan, L. Qiu, and H. J. Wang. Passive network tomography using Bayesian inference. In IMW, 2002.
[29]
J.-J. Pansiot and D. Grad. On routes and multicast trees in the Internet. ACM CCR, 28(1):41--50, 1998.
[30]
V. Paxson. End-to-end routing behavior in the Internet. IEEE/ACM Transactions on Networking, 5(5):601--615, 1997.
[31]
V. Paxson. Strategies for sound Internet measurement. In IMC, 2004.
[32]
L. Peterson, T. Anderson, D. Culler, and T. Roscoe. A blueprint for introducing disruptive technology into the Internet. In HotNets, 2002.
[33]
J. Postel, editor. Internet protocol. IETF RFC-791, 1981.
[34]
F. Ricca, W. Faber, and N. Leone. A backjumping technique for disjunctive logic programming. The European Journal on Artificial Intelligence, 19(2):155--172, 2006.
[35]
E. C. Rosen, A. Viswanathan, and R. Callon. Multiprotocol label switching architecture. IETF RFC-3031, 2001.
[36]
S. Savage, phet al. The end-to-end effects of Internet path selection. In ACM SIGCOMM, 1999.
[37]
R. Sherwood and N. Spring. A platform for unobtrusive measurement on PlanetLab. In USENIX Workshop on Real, Large Distributed Systems (WORLDS), 2006.
[38]
R. Sherwood and N. Spring. Touring the Internet in a TCP sidecar. In IMC, 2006.
[39]
N. Spring, R. Mahajan, and T. Anderson. Quantifying the causes of path inflation. In ACM SIGCOMM, 2003.
[40]
N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with Rocketfuel. In ACM SIGCOMM, 2002.
[41]
N. Spring, D. Wetherall, and T. Anderson. Scriptroute: A public Internet measurement facility. In USITS, 2003.
[42]
J. Strauss, D. Kitabi, and F. Kaashoek. A Measurement Study of Available Bandwidth Estimation Tools. In IMC, 2003.
[43]
H. Tangmunarunkit, R. Govindan, and S. Shenker. Internet path inflation due to policy routing. In SPIE ITCOM Workshop on Scalability and Traffic Control in IP Networks, vol. 4526, 2001.
[44]
R. Teixeira, K. Marzullo, S. Savage, and G. Voelker. In search of path diversity in ISP networks. In IMC, 2003.
[45]
B. Yao, R. Viswanathan, F. Chang, and D. Waddington. Topology inference in the presence of anonymous routers. In INFOCOM, 2003.
[46]
E. W. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internetwork. In INFOCOM, 1996.

Cited By

View all
  • (2024)AliasClassifier: A High-Performance Router Alias ClassifierElectronics10.3390/electronics1309174713:9(1747)Online publication date: 1-May-2024
  • (2023)A Global Measurement of Routing Loops on the InternetPassive and Active Measurement10.1007/978-3-031-28486-1_16(373-399)Online publication date: 21-Mar-2023
  • (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
  • Show More Cited By

Index Terms

  1. Discarte: a disjunctive internet cartographer

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SIGCOMM '08: Proceedings of the ACM SIGCOMM 2008 conference on Data communication
    August 2008
    452 pages
    ISBN:9781605581750
    DOI:10.1145/1402958
    • cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 38, Issue 4
      October 2008
      436 pages
      ISSN:0146-4833
      DOI:10.1145/1402946
      Issue’s Table of Contents
    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: 17 August 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. alias resolution
    2. discarte
    3. disjunctive logic programming
    4. network topology discovery
    5. record route

    Qualifiers

    • Research-article

    Conference

    SIGCOMM '08
    Sponsor:
    SIGCOMM '08: ACM SIGCOMM 2008 Conference
    August 17 - 22, 2008
    WA, Seattle, USA

    Acceptance Rates

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

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)147
    • Downloads (Last 6 weeks)14
    Reflects downloads up to 05 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)AliasClassifier: A High-Performance Router Alias ClassifierElectronics10.3390/electronics1309174713:9(1747)Online publication date: 1-May-2024
    • (2023)A Global Measurement of Routing Loops on the InternetPassive and Active Measurement10.1007/978-3-031-28486-1_16(373-399)Online publication date: 21-Mar-2023
    • (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
    • (2021)Cloudy with a chance of short RTTsProceedings of the 21st ACM Internet Measurement Conference10.1145/3487552.3487854(62-79)Online publication date: 2-Nov-2021
    • (2021)Inferring regional access network topologiesProceedings of the 21st ACM Internet Measurement Conference10.1145/3487552.3487812(720-738)Online publication date: 2-Nov-2021
    • (2020)A First Comparative Characterization of Multi-cloud Connectivity in Today’s InternetPassive and Active Measurement10.1007/978-3-030-44081-7_12(193-210)Online publication date: 18-Mar-2020
    • (2019)TNT, Watch me Explode: A Light in the Dark for Revealing MPLS Tunnels2019 Network Traffic Measurement and Analysis Conference (TMA)10.23919/TMA.2019.8784525(65-72)Online publication date: Jun-2019
    • (2019)How Cloud Traffic Goes HidingProceedings of the Internet Measurement Conference10.1145/3355369.3355602(202-216)Online publication date: 21-Oct-2019
    • (2019)Learning Regexes to Extract Router Names from HostnamesProceedings of the Internet Measurement Conference10.1145/3355369.3355589(337-350)Online publication date: 21-Oct-2019
    • (2018)Mixture matrix completionProceedings of the 32nd International Conference on Neural Information Processing Systems10.5555/3327144.3327147(2197-2207)Online publication date: 3-Dec-2018
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media