The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Collecting the internet AS-level topology
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
Border Gateway Protocol 3 (BGP-3)
Lougheed, K., & Rekhter, Y. (1991) · doi:10.17487/rfc1267 · Cited by 1,977
BRITE: an approach to universal topology generation
Medina, A., Lakhina, A., Matta, I., & Byers, J. (2002) · MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems · doi:10.1109/mascot.2001.948886 · Cited by 1,226
On inferring autonomous system relationships in the Internet
Gao, L. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.974527 · Cited by 1,070
Park, K., & Lee, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383061 · Cited by 572
The Internet Engineering Task Force
Needleman, M. (2000) · Serials Review · doi:10.1016/s0098-7913(99)00073-8 · Cited by 457
The origin of power laws in Internet topologies revisited
Chen, Q., Chang, H., Govindan, R., & Jamin, S. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019306 · Cited by 430
Sampling biases in IP topology measurements
Lakhina, A., Byers, J. W., Crovella, M., & Xie, P. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1208685 · Cited by 303
Internet Engineering Task Force
(2018) · The SAGE Encyclopedia of the Internet · doi:10.4135/9781473960367.n143 · Cited by 266
Routing Policy Specification Language (RPSL)
Alaettinoglu, C., Bates, T., Gerich, E., Karrenberg, D., Meyer, D., Terpstra, M., & Villamizar, C. (1998) · doi:10.17487/rfc2280 · Cited by 183
Cited by
Anomaly Detection in Dynamic Graphs via Transformer
Liu, Y., Pan, S., Wang, Y. G., Xiong, F., Wang, L., Chen, Q., & Lee, V. C. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3124061 · Cited by 169
Structural Temporal Graph Neural Networks for Anomaly Detection in Dynamic Graphs
Cai, L., Chen, Z., Luo, C., Gui, J., Ni, J., Li, D., & Chen, H. (2021) · Proceedings of the 30th ACM International Conference on Information & Knowledge Management · doi:10.1145/3459637.3481955 · Cited by 146
Krioukov, D., Kitsak, M., Sinkovits, R. S., Rideout, D., Meyer, D., & Boguñá, M. (2012) · Scientific Reports · doi:10.1038/srep00793 · Cited by 128
Structural-temporal coupling anomaly detection with dynamic graph transformer
Zong, C., Zhuang, Y., Shao, J., & Lu, W. (2026) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-025-01176-6 · Cited by 3
Metadata
- Authors
- Zhang, B., Liu, R., Massey, D., & Zhang, L.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2005-01
- Volume
- 35
- Issue
- 1
- Pages
- 53-61
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W1999507172
- Cited by
- 285
- References
- 11
- FWCI
- 23.26
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Collecting the internet AS-level topology. https://app.cochat.ai/papers/10.1145/1052812.1052825
- The paper
- Zhang, B., Liu, R., Massey, D., & Zhang, L. (2005). Collecting the internet AS-level topology. ACM SIGCOMM Computer Communication Review. https://doi.org/10.1145/1052812.1052825
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.