The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
The Internet Topology Zoo
Abstract
The study of network topology has attracted a great deal of attention in the last decade, but has been hampered by a lack of accurate data. Existing methods for measuring topology have flaws, and arguments about the importance of these have overshadowed the more interesting questions about network structure. The Internet Topology Zoo is a store of network data created from the information that network operators make public. As such it is the most accurate large-scale collection of network topologies available, and includes meta-data that couldn't have been measured. With this data we can answer questions about network structure with more certainty than ever before - we illustrate its power through a preliminary analysis of the PoP-level topology of over 140 networks. We find a wide range of network designs not conforming as a whole to any obvious model.
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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
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
Exploring Network Structure, Dynamics, and Function Using NetworkX
Hagberg, A. A., Schult, D. A., & Swart, P. J. (2008) · Proceedings of the Python in Science Conference · doi:10.25080/tcwv9851 · Cited by 7,477
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
Bollobás, B. (1985) · Cited by 6,196
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
Routing of multipoint connections
Waxman, B. M. (1988) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.12889 · Cited by 2,885
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
Zegura, E. W., Calvert, K. L., & Bhattacharjee, S. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1996.493353 · Cited by 1,679
Measuring ISP topologies with rocketfuel
Spring, N., Mahajan, R., & Wetherall, D. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633039 · Cited by 1,256
Gilbert, E. N. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706098 · Cited by 1,122
Modeling the Internet's large-scale topology
Yook, S.-H., Jeong, H., & Barabási, A.-L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.172501399 · Cited by 665
iPlane: an information plane for distributed services
Madhyastha, H. V., Isdal, T., Piatek, M., Dixon, C., Anderson, T. E., Krishnamurthy, A., & Venkataramani, A. (2006) · doi:10.5555/1298455.1298490 · Cited by 526
The “robust yet fragile” nature of the Internet
Doyle, J. C., Alderson, D. L., Li, L., Low, S., Roughan, M., Shalunov, S., Tanaka, R., & Willinger, W. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0501426102 · Cited by 474
Self-citationRequirements for IP Version 4 Routers
(1995) · doi:10.17487/rfc1812 · Cited by 462
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
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
NetScope: traffic engineering for IP networks
Feldmann, A., Greenberg, A., Lund, C., Reingold, N., & Rexford, J. (2000) · IEEE Network · doi:10.1109/65.826367 · Cited by 224
Ten years in the evolution of the internet ecosystem
Dhamdhere, A. D., & Dovrolis, C. (2008) · ACM Internet Measurement Conference (IMC) · doi:10.1145/1452520.1452543 · Cited by 151
OSPF monitoring: architecture, design and deployment experience
Shaikh, A., & Greenberg, A. G. (2004) · Networked Systems Design and Implementation · Cited by 109
Rasti, A. H., Magharei, N., Rejaie, R., & Willinger, W. (2010) · ACM Internet Measurement Conference (IMC) · doi:10.1145/1879141.1879165 · Cited by 27
Cited by
The controller placement problem
Heller, B., Sherwood, R., & McKeown, N. (2012) · Proceedings of the first workshop on Hot topics in software defined networks · doi:10.1145/2342441.2342444 · Cited by 869
Smart Resource Allocation for Mobile Edge Computing: A Deep Reinforcement Learning Approach
Wang, J., Zhao, L., Liu, J., & Kato, N. (2021) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2019.2902661 · Cited by 451
Heuristic Approaches to the Controller Placement Problem in Large Scale SDN Networks
Lange, S., Gebert, S., Zinner, T., Tran-Gia, P., Hock, D., Jarschel, M., & Hoffmann, M. (2015) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2015.2402432 · Cited by 393
On the Capacitated Controller Placement Problem in Software Defined Networks
Yao, G., Bi, J., Li, Y., & Guo, L. (2014) · IEEE Communications Letters · doi:10.1109/lcomm.2014.2332341 · Cited by 366
Pareto-optimal resilient controller placement in SDN-based core networks
Hock, D., Hartmann, M., Gebert, S., Jarschel, M., Zinner, T., & Tran-Gia, P. (2013) · Proceedings of the 2013 25th International Teletraffic Congress (ITC) · doi:10.1109/itc.2013.6662939 · Cited by 274
Metadata
- Authors
- Knight, S., Nguyen, H. X., Falkner, N., Bowden, R., & Roughan, M.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2011-10
- Volume
- 29
- Issue
- 9
- Pages
- 1765-1775
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2118404561
- Cited by
- 1,739
- References
- 23
- FWCI
- 37.97
- 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
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.