The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Power laws and the AS-level internet topology
Abstract
We study and characterize the topology of the Internet at the autonomous system (AS) level. First, we show that the topology can be described efficiently with power laws. The elegance and simplicity of the power laws provide a novel perspective into the seemingly uncontrolled Internet structure. Second, we show that power laws have appeared consistently over the last five years. We also observe that the power laws hold even in the most recent and more complete topology with correlation coefficient above 99% for the degree-based power law. In addition, we study the evolution of the power-law exponents over the five-year interval and observe a variation for the degree-based power law of less than 10%. Thirdly, we provide relationships between the exponents and other topological metrics.
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
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
Large-scale topological and dynamical properties of the Internet
Vázquez, A., Pastor-Satorras, R., & Vespignani, A. (2002) · Physical Review E · doi:10.1103/physreve.65.066130 · Cited by 712
Cited by
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
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
Networked Gatekeeping and Networked Framing on #Egypt
Meraz, S., & Papacharissi, Z. (2013) · The International Journal of Press/Politics · doi:10.1177/1940161212474472 · Cited by 580
Characterization of Failures in an Operational IP Backbone Network
Markopoulou, A., Iannaccone, G., Bhattacharyya, S., Chuah, C.-N., Ganjali, Y., & Diot, C. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.902727 · Cited by 407
Netprobe: a fast and scalable system for fraud detection in online auction networks
Pandit, S., Chau, D. H., Wang, S., & Faloutsos, C. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242600 · Cited by 382
Self-citation
Metadata
- Authors
- Siganos, G., Faloutsos, M., Faloutsos, P., & Faloutsos, C.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2003-08
- Volume
- 11
- Issue
- 4
- Pages
- 514-524
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2128181433
- Cited by
- 369
- References
- 2
- FWCI
- 14.23
- 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: Power laws and the AS-level internet topology. https://app.cochat.ai/papers/10.1109/tnet.2003.815300
- The paper
- Siganos, G., Faloutsos, M., Faloutsos, P., & Faloutsos, C. (2003). Power laws and the AS-level internet topology. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2003.815300
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.