skip to main content
10.1145/1064212.1064257acmconferencesArticle/Chapter ViewAbstractPublication PagesmetricsConference Proceedingsconference-collections
Article

On AS-level path inference

Published: 06 June 2005 Publication History

Abstract

The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing techniques and tools for path discovery require direct access to the source. However, the uncooperative nature of the Internet makes it difficult to get direct access to any remote end-point. Path inference becomes challenging when we have no access to the source or the destination. Moveover even when we have access to the source and know the forward path, it is nontrivial to infer the reverse path, since the Internet routing is often asymmetric.In this paper, we explore the feasibility of AS-level path inference without direct access to either end-points. We describe RouteScope-a tool for inferring AS-level paths by finding the shortest policy paths in an AS graph obtained from BGP tables collected from multiple vantage points. We identify two main factors that affect the path inference accuracy: the accuracy of AS relationship inference and the ability to determine the first AS hop. To address the issues, we propose two novel techniques: a new AS relation-ship inference algorithm, and a novel scheme to infer the first AS hop by exploiting the TTL information in IP packets. We evaluate the effectiveness of RouteScope using both BGP tables and the AS paths collected from public BGP gateways. Our results show that it achieves 70% - 88% accuracy in path inference.

References

[1]
G. Battista, M. Patrignani, and M. Pizzonia. Computing the Types of the Relationships Between Autonomous Systems. In Proc. IEEE INFOCOM, March 2003.
[2]
O. Bonaventure, P. Trimintzios, G. Pavlou, B. Quoitin, A. Azcorra, M. Bagnulo, P. Flegkas, A. Garcia-Martinez, P. Georgatsos, L. Georgiadis, C. Jacquenet, L. Swinnen, S. Tandel, and S. Uhlig. Internet Traffic Engineering. In Quality of Future Internet Services, 2003.
[3]
M. Coates, R. Castro, R. Nowak, M. Gadhiok, R. King, and Y. Tsang. Maximum Likelihood Network Topology Identification from Edge-based Unicast Measurements. In Proc. ACM SIGMETRICS, June 2002.
[4]
L. Gao. On Inferring Automonous System Relationships in the Internet. In IEEE/ACM Trans. Networking, December 2001.
[5]
R. Govindan and H. Tangmunarunkit. Heuristics for Internet Map Discovery. In Proc. ACM SIGCOMM, March 2000.
[6]
G. Huston. BGP table statistics. http://bgp.potaroo.net.
[7]
V. Jacobson. Traceroute. ftp://ftp.ee.lbl.gov/traceroute.tar.gz.
[8]
R. Mahajan, N. Spring, D. Wetherall, and T. Anderson. Inferring Link Weights using End-to-End Measurements. In Proc. Internet Measurement Workshop, November 2002.
[9]
Z. M. Mao, D. Johnson, J. Rexford, J. Wang, and R. Katz. Scalable and Accurate Identification of AS-Level Forwarding Paths. In Proc. IEEE INFOCOM, March 2004.
[10]
Z. M. Mao, J. Rexford, J. Wang, and R. Katz. Towards an Accurate AS-Level Traceroute Tool. In Proc. ACM SIGCOMM, August 2003.
[11]
P. R. McManus. A Passive System for Server Selection within Mirrored Resource Environments Using AS Path Length Heuristics. Apr. 1999. http://www.ducksong.com:81/patrick/proximate.pdf.
[12]
T. Ogino, M. Kosaka, Y. Hariyama, K. Matsuda, and K. Sudo. Study of an Efficient Server Selection Method for Widely Distributed Web Server Networks. In The 10th Annual Internet Society Conference (INET), July 2000. http://www.isoc.org/inet2000/cdproceedings/1g/1g_1.htm.
[13]
V. Paxson. End-to-End Routing Behavior in the Internet. IEEE/ACM Trans. Networking, pages 601--615, October 1997.
[14]
V. Paxson. Measurements and Analysis of End-to-End Internet Dynamics. PhD thesis, U.C. Berkeley, 1997.
[15]
PlanetLab. http://www.planet-lab.org.
[16]
J. Rexford, J. Wang, Z. Xiao, and Y. Zhang. BGP Routing Stability of Popular Destinations. In Proc. Internet Measurement Workshop, November 2002.
[17]
B. Selman, H. Kautz, and B. Cohen. Local Search Strategies for Satisfiability Testing. In Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993.
[18]
N. Spring, R. Majajan, and D. Wetherall. Measuring ISP Topologies with Rocketfuel. In Proc. ACM SIGCOMM, August 2002.
[19]
L. Subramanian, S. Agarwal, J. Rexford, and R. Katz. Characterizing the Internet hierarchy from multiple vantage points. In Proc. IEEE INFOCOM, June 2002.
[20]
Traceroute.org. http://www.traceroute.org/.
[21]
B. Zhang, R. Liu, D. Massey, and L. Zhang. Collecting the Internet AS-level Topology. In ACM SIGCOMM Computer Communication Review (CCR), special issue on Internet Vital Statistics, January 2005.

Cited By

View all
  • (2024)Hidden-SAGE: For the Inference of Complex Autonomous System Business Relationships Involving Hidden LinksElectronics10.3390/electronics1309161713:9(1617)Online publication date: 23-Apr-2024
  • (2024)Assessing the security of Internet paths: A case study of Dutch critical infrastructuresProceedings of the 2024 Applied Networking Research Workshop10.1145/3673422.3674899(67-73)Online publication date: 23-Jul-2024
  • (2023)Revelio: A Network-Level Privacy Attack in the Lightning Network2023 IEEE 8th European Symposium on Security and Privacy (EuroS&P)10.1109/EuroSP57164.2023.00060(942-957)Online publication date: Jul-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMETRICS '05: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
June 2005
428 pages
ISBN:1595930221
DOI:10.1145/1064212
  • cover image ACM SIGMETRICS Performance Evaluation Review
    ACM SIGMETRICS Performance Evaluation Review  Volume 33, Issue 1
    Performance evaluation review
    June 2005
    417 pages
    ISSN:0163-5999
    DOI:10.1145/1071690
    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: 06 June 2005

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. AS-level path
  2. border gateway protocol
  3. internet routing
  4. network topology

Qualifiers

  • Article

Conference

SIGMETRICS05

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)28
  • Downloads (Last 6 weeks)1
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Hidden-SAGE: For the Inference of Complex Autonomous System Business Relationships Involving Hidden LinksElectronics10.3390/electronics1309161713:9(1617)Online publication date: 23-Apr-2024
  • (2024)Assessing the security of Internet paths: A case study of Dutch critical infrastructuresProceedings of the 2024 Applied Networking Research Workshop10.1145/3673422.3674899(67-73)Online publication date: 23-Jul-2024
  • (2023)Revelio: A Network-Level Privacy Attack in the Lightning Network2023 IEEE 8th European Symposium on Security and Privacy (EuroS&P)10.1109/EuroSP57164.2023.00060(942-957)Online publication date: Jul-2023
  • (2022)On Capturing DDoS Traffic Footprints on the InternetIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2021.307408619:4(2755-2770)Online publication date: 1-Jul-2022
  • (2022)Research on the derivation of AS hidden links and the Discovery of Critical AS2022 IEEE 47th Conference on Local Computer Networks (LCN)10.1109/LCN53696.2022.9843337(267-270)Online publication date: 26-Sep-2022
  • (2020)CLAPS: Client-Location-Aware Path Selection in TorProceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security10.1145/3372297.3417279(17-34)Online publication date: 30-Oct-2020
  • (2019)Learning from Sets of Items in Recommender SystemsACM Transactions on Interactive Intelligent Systems10.1145/33261289:4(1-26)Online publication date: 25-Jul-2019
  • (2019)A Map-Reduce-Based Relation Inference Algorithm for Autonomous System2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)10.1109/PDCAT46702.2019.00091(467-470)Online publication date: Dec-2019
  • (2018)PathFinder: Capturing DDoS Traffic Footprints on the Internet2018 IFIP Networking Conference (IFIP Networking) and Workshops10.23919/IFIPNetworking.2018.8696909(1-9)Online publication date: May-2018
  • (2017)Use the scientific method in computer scienceCommunications of the ACM10.1145/303296560:2(8-9)Online publication date: 23-Jan-2017
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media