The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
The internet AS-level topology: three data sources and one definitive metric
Open accessAbstract
We calculate an extensive set of characteristics for Internet AS topologies extracted from the three data sources most frequently used by the research community: traceroutes, BGP, and WHOIS. We discover that traceroute and BGP topologies are similar to one another but differ substantially from the WHOIS topology. Among the widely considered metrics, we find that the joint degree distribution appears to fundamentally characterize Internet AS topologies as well as narrowly define values for other important metrics. We discuss the interplay between the specifics of the three data collection mechanisms and the resulting topology views. In particular, we how how the data collection peculiarities explain differences in the resulting joint degree distributions of the respective topologies. Finally, we release to the community the input topology datasets, along with the scripts and output of our calculations. This supplement hould enable researchers to validate their models against real data and to make more informed election of topology data sources for their specific needs
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Assortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
A faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Distributed Computing: A Locality-Sensitive Approach
Peleg, D. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719772 · Cited by 1,487
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
Coates, A., Hero III, A. O., Nowak, R., & Yu, B. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.998081 · Cited by 529
On distinguishing between Internet power law topology generators
Bu, T., & Towsley, D. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019309 · Cited by 516
Mathematical results on scale‐free random graphs
Bollobás, B., & Riordan, O. M. (2002) · Handbook of Graphs and Networks · doi:10.1002/3527602755.ch1 · Cited by 463
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
Network topology generators: degree-based vs. structural
Tangmunarunkit, H., Govindan, R., Jamin, S., Shenker, S., & Willinger, W. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633040 · Cited by 375
A first-principles approach to understanding the internet's router-level topology
Li, L., Alderson, D., Willinger, W., & Doyle, J. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015470 · Cited by 354
Towards an accurate AS-level traceroute tool
Mao, Z. M., Rexford, J., Wang, J., & Katz, R. H. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863996 · Cited by 351
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
Guidelines for creation, selection, and registration of an Autonomous System (AS)
Hawkinson, J., & Bates, T. (1996) · doi:10.17487/rfc1930 · Cited by 294
Accurately modeling the internet topology
Zhou, S., & Mondragón, R. J. (2004) · Physical Review E · doi:10.1103/physreve.70.066108 · Cited by 211
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · Oxford University Press eBooks · Cited by 190
k-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
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 166
Compact routing on internet-like graphs
Krioukov, D., Fall, K., & Yang, X. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354495 · Cited by 149
Self-citationA simple conceptual model for the Internet topology
Tauro, S. L., Palmer, C., Siganos, G., & Faloutsos, M. (2002) · Globecom · doi:10.1109/glocom.2001.965863 · Cited by 127
Conductance and congestion in power law graphs
Gkantsidis, C., Mihail, M., & Saberi, A. (2003) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/781027.781046 · Cited by 122
Analyzing BGP policies: methodology and tool
Siganos, G., & Faloulsos, M. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354576 · Cited by 105
claffy, K., Monk, T., & McRobb, D. (1999) · Nature · doi:10.1038/nature28028 · Cited by 73
Self-citationInferring AS relationships: Dead end or lively beginning
Dimitropoulos, X. A., Krioukov, D., Huffaker, B., claffy, K., & Riley, G. (2005) · Cited by 56
Self-citationInferring AS Relationships: Dead End or Lively Beginning?
Dimitropoulos, X. A., Krioukov, D., Huffaker, B., claffy, K., & Riley, G. (2005) · Lecture notes in computer science · doi:10.1007/11427186_12 · Cited by 31
Self-citation
Cited by
Zhang, L., Afanasyev, A., Burke, J., Jacobson, V., claffy, K., Crowley, P., Papadopoulos, C., Wang, L., & Zhang, B. (2014) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2656877.2656887 · Cited by 2,270
Self-citationKnight, S., Nguyen, H. X., Falkner, N., Bowden, R., & Roughan, M. (2011) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2011.111002 · Cited by 1,739
The topology of interbank payment flows
Soramäki, K., Bech, M. L., Arnold, J., Glass, R. J., & Beyeler, W. E. (2007) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.11.093 · Cited by 636
Navigability of complex networks
Boguñá, M., Krioukov, D., & Claffy, K. C. (2009) · Nature Physics · doi:10.1038/nphys1130 · Cited by 486
Self-citationSelf-Similarity of Complex Networks and Hidden Metric Spaces
Serrano, M. Á., Krioukov, D., & Boguñá, M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.078701 · Cited by 332
Self-citation
Metadata
- Authors
- Mahadevan, P., Krioukov, D., Fomenkov, M., Dimitropoulos, X., claffy, K. C., & Vahdat, A.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2006-01-10
- Volume
- 36
- Issue
- 1
- Pages
- 17-26
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2139905147
- Cited by
- 338
- References
- 28
- FWCI
- 24.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
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.