The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
The origin of power laws in Internet topologies revisited
Abstract
C. Faloutsos et al. (see Proc. ACM SIGCOMM, 1999) found that the inter autonomous system (AS) topology exhibits a power-law vertex degree distribution. This result was quite unexpected in the networking community and stirred significant interest in exploring the possible causes of this phenomenon. The work of A.-L. Barabasi and R. Albert (see Science, p.509-512, 1999) and its application to network topology generation in the work of A. Medina et al. (see Proc. MASCOTS, 2001) have explored a promising class of models that yield strict power-law vertex degree distributions. We re-examine the BGP (border gateway protocol) measurements that form the basis for the results reported by Faloutsos et al. We find that by their very nature (i.e., being strictly BGP-based), the data provides a very incomplete picture of Internet connectivity at the AS level. The AS connectivity maps constructed from this data (original maps) typically miss 20-50% or even more of the physical links in AS maps constructed using additional sources (extended maps). Subsequently, we find that while the vertex degree distributions resulting from the extended maps are heavy-tailed, they deviate significantly from a strict power law. Finally, we show that available historical data does not support the connectivity-based dynamics assumed by Barabasi and Albert. Together, our results suggest that the Internet topology at the AS level may well have developed over time following a very different set of growth processes than those proposed by Barabasi and Albert.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
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
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
Topology of Evolving Networks: Local Events and Universality
Albert, R., & Barabási, A.-L. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5234 · Cited by 1,308
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
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Assortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.67.026126 · Cited by 3,087
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016132 · Cited by 2,613
Why social networks are different from other types of networks
Newman, M. E. J., & Park, J. (2003) · Physical Review E · doi:10.1103/physreve.68.036122 · Cited by 1,354
A Survey of Statistical Network Models
Goldenberg, A., Zheng, A. X., Fienberg, S. E., & Airoldi, E. M. (2010) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000005 · Cited by 819
Analyzing and modeling real-world phenomena with complex networks: a survey of applications
Costa, L. D. F., Oliveira, O. N., Travieso, G., Rodrigues, F. A., Villas Boas, P. R., Antiqueira, L., Viana, M. P., & Correa Rocha, L. E. (2011) · Advances in Physics · doi:10.1080/00018732.2011.572452 · Cited by 800
The Rich-Club Phenomenon in the Internet Topology
Zhou, S., & Mondragon, R. J. (2004) · IEEE Communications Letters · doi:10.1109/lcomm.2004.823426 · Cited by 611
Graph mining: Laws, generators, and algorithms
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 609
Managing and Mining Graph Data
(2010) · Advances in Database Systems · doi:10.1007/978-1-4419-6045-0 · Cited by 594
Labovitz, C., Iekel-Johnson, S., McPherson, D., Oberheide, J., & Jahanian, F. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851194 · Cited by 545
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
Power laws and the AS-level internet topology
Siganos, G., Faloutsos, M., Faloutsos, P., & Faloutsos, C. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.815300 · Cited by 369
Using Graph Models to Analyze the Vulnerability of Electric Power Networks
Holmgren, Å. J. (2006) · Risk Analysis · doi:10.1111/j.1539-6924.2006.00791.x · Cited by 358
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
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
Berners-Lee, T., Hall, W., Hendler, J. A., O'Hara, K., Shadbolt, N., & Weitzner, D. J. (2006) · Foundations and Trends® in Web Science · doi:10.1561/1800000001 · Cited by 325
Collecting the internet AS-level topology
Zhang, B., Liu, R., Massey, D., & Zhang, L. (2005) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1052812.1052825 · Cited by 285
Bipartite graphs as models of complex networks
Guillaume, J.-L., & Latapy, M. (2006) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.04.047 · Cited by 282
Assortativity in complex networks
Noldus, R., & Van Mieghem, P. (2015) · Journal of Complex Networks · doi:10.1093/comnet/cnv005 · Cited by 266
Metadata
- Authors
- Chen, Q., Chang, H., Govindan, R., & Jamin, S.
- Venue
- Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
- Publisher
- IEEE
- Published
- 2003-06-25
- Volume
- 2
- Pages
- 608-617
- OpenAlex
- W1920896335
- Cited by
- 430
- References
- 16
- FWCI
- 101.83
- Type
- conference paper
- 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
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.