The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
AS relationships: inference and validation
Open accessAbstract
Research on performance, robustness, and evolution of the global Internet is fundamentally handicapped without accurate and thorough knowledge of the nature and structure of the contractual relationships between Autonomous Systems (ASs). In this work we introduce novel heuristics for inferring AS relationships. Our heuristics improve upon previous works in several technical aspects, which we outline in detail and demonstrate with several examples. Seeking to increase the value and reliability of our inference results, we then focus on validation of inferred AS relationships. We perform a survey with ASs' network administrators to collect information on the actual connectivity and policies of the surveyed ASs. Based on the survey results, we find that our new AS relationship inference techniques achieve high levels of accuracy: we correctly infer 96.5% customer to provider (c2p), 82.8% peer to peer (p2p), and 90.3% sibling to sibling (s2s) relationships. We then cross-compare the reported AS connectivity with the AS connectivity data contained in BGP tables. We find that BGP tables miss up to 86.2% of the true adjacencies of the surveyed ASs. The majority of the missing links are of the p2p type, which highlights the limitations of present measuring techniques to capture links of this type. Finally, to make our results easily accessible and practically useful for the community, we open an AS relationship repository where we archive, on a weekly basis, and make publicly available the complete Internet AS-level topology annotated with AS relationship information for every pair of AS neighbors.
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
(1979) · Cited by 43,841
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
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
Understanding BGP misconfiguration
Mahajan, R., Wetherall, D., & Anderson, T. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633027 · Cited by 533
Shavitt, Y., & Shir, E. (2005) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1096536.1096546 · Cited by 418
The internet AS-level topology: three data sources and one definitive metric
Mahadevan, P., Krioukov, D., Fomenkov, M., Dimitropoulos, X., claffy, K. C., & Vahdat, A. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1111322.1111328 · Cited by 338
Self-citationk-core decomposition: a tool for the visualization of large scale networks
Alvarez-Hamelin, J. I., Dall’Asta, L., Barrat, A., & Vespignani, A. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0504107 · Cited by 183
HLP: a next generation inter-domain routing protocol
Subramanian, L., Caesar, M., Ee, C. T., Handley, M., Mao, M., Shenker, S., & Stoica, I. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080095 · Cited by 176
Exploring networks with traceroute-like probes: Theory and simulations
Dall’Asta, L., Alvarez-Hamelin, J. I., Barrat, A., Vázquez, A., & Vespignani, A. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.12.009 · Cited by 156
On the evaluation of AS relationship inferences
Xia, J., & Gao, L. (2005) · Globecom · doi:10.1109/glocom.2004.1378209 · Cited by 109
Cited by
Power-Law Distributions in Empirical Data
Clauset, A., Shalizi, C. R., & Newman, M. E. J. (2009) · SIAM Review · doi:10.1137/070710111 · Cited by 8,019
Hyperbolic geometry of complex networks
Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., & Boguñá, M. (2010) · Physical Review E · doi:10.1103/physreve.82.036106 · Cited by 1,059
Self-citation
Metadata
- Authors
- Dimitropoulos, X., Krioukov, D., Fomenkov, M., Huffaker, B., Hyun, Y., claffy, K., & Riley, G.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2007-01-22
- Volume
- 37
- Issue
- 1
- Pages
- 29-40
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2120514843
- Cited by
- 305
- References
- 14
- FWCI
- 50.25
- Type
- journal article
- Language
- en
- Open access
- green
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: AS relationships: inference and validation. https://app.cochat.ai/papers/10.1145/1198255.1198259
- The paper
- Dimitropoulos, X., Krioukov, D., Fomenkov, M., Huffaker, B., Hyun, Y., claffy, K., & Riley, G. (2007). AS relationships: inference and validation. ACM SIGCOMM Computer Communication Review. https://doi.org/10.1145/1198255.1198259
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.