Nothing Special   »   [go: up one dir, main page]

skip to main content
article

Collecting the internet AS-level topology

Published: 01 January 2005 Publication History

Abstract

At the inter-domain level, the Internet topology can be represented by a graph with Autonomous Systems (ASes) as nodes and AS peerings as links. This AS-level topology graph has been widely used in a variety of research efforts. Conventionally this topology graph is derived from routing tables collected by Route Views or RIPE RIS. In this work, we assemble the most complete AS-level topology by extending the conventional method along two dimensions. First, in addition to using data from RouteViews and RIPE RIS, we also collect data from many other sources, including route servers, looking glasses, and routing registries. Second, in addition to using routing tables, we also accumulate topological information from routing updates over time. The resulting topology graph on a recent day contains 44% more links and 3% more nodes than that from using RouteViews routing tables alone. Our data collection and topology generation process have been automated, and we publish the latest topology on the web on a daily basis.

References

[1]
bgpdump. http://www.ris.ripe.net/source/libbgpdump-1.4.tar.gz.]]
[2]
CAIDA's macroscopic topology AS adjacencies. http://www.caida.org/tools/measurement/skitter/as_adjacencies.xml, June 2004.]]
[3]
C. Alaettinoglu, C. Villamizar, E. Gerich, D. Kessens, D. Meyer, T. Bates, D. Karrenberg, and M. Terpstra. Routing policy specification language (RPSL). RFC 2622, Internet Engineering Task Force, June 1999.]]
[4]
P. Barford, A. Bestavros, J. Byers, and M. Crovella. On the marginal utility of network topology measurements. In ACM SIGCOMM Internet Measurement Workshop (IMW), 2001.]]
[5]
G. D. Battista, M. Patrignani, and M. Pizzonia. Computing the types of the relationships between autonomous systems. In Proc. of IEEE INFOCOM, Mar. 2003.]]
[6]
H. Chang, R. Govindan, S. Jamin, S. J. Shenker, and W. Willinger. Towards capturing representative AS-level Internet topologies. Computer Networks, 44(6):737--755, Apr. 2004.]]
[7]
Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. The origin of power-laws in Internet topologies revisited. In Proc. of IEEE INFOCOM, June 2002.]]
[8]
M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In Proc. of ACM SIGCOMM, 1999.]]
[9]
L. Gao. On inferring autonomous system relationships in the Internet. ACM/IEEE Transactions on Networking, 9(6):733--745, 2001.]]
[10]
Z. Ge, D. Figueiredo, S. Jaiwal, and L. Gao. On the hierarchical structure of the logical Internet graph. In ITCOM, 2001.]]
[11]
R. Govindan and A. Reddy. An analysis of Internet inter-domain topology and route stability. In Proc. of IEEE INFOCOM, 1997.]]
[12]
A. Lakhina, J. W. Byers, M. Crovella, and P. Xie. Sampling biases in IP topology measurements. In Proc. of IEEE INFOCOM, 2003.]]
[13]
A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: An approach to universal topology generation. In Proc. of MASCOTS, Aug. 2001.]]
[14]
K. Park and H. Lee. On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law Internets. In Proc. of ACM SIGCOMM, pages 15--26, 2001.]]
[15]
Y. Rekhter and T. Li. Border Gateway Protocol 4. RFC 1771, Internet Engineering Task Force, July 1995.]]
[16]
The RIPE Routing Information Services. http://www.ris.ripe.net.]]
[17]
The Route Views Project. http://www.antc.uoregon.edu/route-views/.]]
[18]
L. Subramanian, S. Agarwal, J. Rexford, and R. H. Katz. Characterizing the Internet hierarchy from multiple vantage points. In Proc. of IEEE INFOCOM, June 2002.]]
[19]
J. Xia and L. Gao. On the evaluation of AS relationship inferences. In Proc. of IEEE GLOBECOM, Dec. 2004.]]

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)Fine-Grained Anomaly Detection on Dynamic Graphs via Attention Alignment2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00246(3178-3190)Online publication date: 13-May-2024
  • (2024)Efficient Management of Physical Infrastructure NetworksNetwork Slicing for Future Wireless Communication10.1007/978-3-031-58229-5_2(13-35)Online publication date: 4-Apr-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review
ACM SIGCOMM Computer Communication Review  Volume 35, Issue 1
January 2005
108 pages
ISSN:0146-4833
DOI:10.1145/1052812
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 2005
Published in SIGCOMM-CCR Volume 35, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)36
  • Downloads (Last 6 weeks)6
Reflects downloads up to 22 Sep 2024

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)Fine-Grained Anomaly Detection on Dynamic Graphs via Attention Alignment2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00246(3178-3190)Online publication date: 13-May-2024
  • (2024)Efficient Management of Physical Infrastructure NetworksNetwork Slicing for Future Wireless Communication10.1007/978-3-031-58229-5_2(13-35)Online publication date: 4-Apr-2024
  • (2023)An in-depth study on key nodes in social networksIntelligent Data Analysis10.3233/IDA-22701827:6(1811-1838)Online publication date: 1-Jan-2023
  • (2023)Anomaly Detection in Dynamic Networks through Edge-Tight Structure Embedding2023 IEEE 22nd International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)10.1109/TrustCom60117.2023.00098(644-651)Online publication date: 1-Nov-2023
  • (2023)Realizing Fine-Grained Inference of AS Path With a Generative Measurable ProcessIEEE/ACM Transactions on Networking10.1109/TNET.2023.327056531:6(3112-3127)Online publication date: Dec-2023
  • (2023)RustGraph: Robust Anomaly Detection in Dynamic Graphs by Jointly Learning Structural-Temporal DependencyIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.332864536:7(3472-3485)Online publication date: 30-Oct-2023
  • (2023)Anomaly Detection in Dynamic Graphs via TransformerIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2021.312406135:12(12081-12094)Online publication date: 1-Dec-2023
  • (2023)Anomaly Detection in Dynamic Graphs Via Long Short-Term Temporal Attention Network2023 International Conference on Machine Learning and Cybernetics (ICMLC)10.1109/ICMLC58545.2023.10327925(153-158)Online publication date: 9-Jul-2023
  • (2023)BGP anomaly detection - a path-based apporach2023 3rd Asia-Pacific Conference on Communications Technology and Computer Science (ACCTCS)10.1109/ACCTCS58815.2023.00100(408-414)Online publication date: Feb-2023
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media