The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Measuring ISP topologies with rocketfuel
Abstract
To date, realistic ISP topologies have not been accessible to the research community, leaving work that depends on topology on an uncertain footing. In this paper, we present new Internet mapping techniques that have enabled us to directly measure router-level ISP topologies. Our techniques reduce the number of required traces compared to a brute-force, all-to-all approach by three orders of magnitude without a significant loss in accuracy. They include the use of BGP routing tables to focus the measurements, exploiting properties of IP routing to eliminate redundant measurements, better alias resolution, and the use of DNS to divide each map into POPs and backbone. We collect maps from ten diverse ISPs using our techniques, and find that our maps are substantially more complete than those of earlier Internet mapping efforts. We also report on properties of these maps, including the size of POPs, distribution of router outdegree, and the inter-domain peering structure. As part of this work, we release our maps to the community.
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
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
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
Zegura, E. W., Calvert, K. L., & Bhattacharjee, S. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1996.493353 · Cited by 1,703
Practical network support for IP traceback
Savage, S., Wetherall, D., Karlin, A., & Anderson, T. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347560 · Cited by 1,127
Self-citationControlling high bandwidth aggregates in the network
Mahajan, R., Bellovin, S. M., Floyd, S., Ioannidis, J., Paxson, V., & Shenker, S. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/571697.571724 · Cited by 742
Self-citationSnoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Kent, S. T., & Strayer, W. T. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383060 · Cited by 733
Heuristics for Internet map discovery
Govindan, R., & Tangmunarunkit, H. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832534 · Cited by 687
Rivest, R. L. (1990) · doi:10.17487/rfc1186 · Cited by 607
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
Cited by
Knight, 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
PlanetLab: an overlay testbed for broad-coverage services
Chun, B., Culler, D., Roscoe, T., Bavier, A., Peterson, L., Wawrzoniak, M., & Bowman, M. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/956993.956995 · Cited by 1,031
Measuring ISP Topologies With Rocketfuel
Spring, N., Mahajan, R., Wetherall, D., & Anderson, T. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.822655 · Cited by 1,010
Self-citationSIMPLE-fying middlebox policy enforcement using SDN
Qazi, Z. A., Tu, C.-C., Chiang, L., Miao, R., Sekar, V., & Yu, M. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486022 · Cited by 642
Hop-count filtering: an effective defense against spoofed DDoS traffic
Jin, C., Wang, H., & Shin, K. G. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948116 · Cited by 468
Orchestrating Virtualized Network Functions
Bari, F., Chowdhury, S. R., Ahmed, R., Boutaba, R., & Duarte, O. C. M. B. (2016) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2016.2569020 · Cited by 417
FIREMAN: a toolkit for firewall modeling and analysis
Yuan, L., Chen, H., Mai, J., Chuah, C.-N., Su, Z., & Mohapatra, P. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.16 · Cited by 398
Can ISPS and P2P users cooperate for improved performance?
Aggarwal, V., Feldmann, A., & Scheideler, C. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1273445.1273449 · Cited by 393
Defense Against Spoofed IP Traffic Using Hop-Count Filtering
Wang, H., Jin, C., & Shin, K. G. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.890133 · Cited by 374
Dynamic Controller Provisioning in Software Defined Networks
Bari, M. F., Roy, A. R., Chowdhury, S. R., Zhang, Q., Zhani, M. F., Ahmed, R., & Boutaba, R. (2013) · Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013) · doi:10.1109/cnsm.2013.6727805 · Cited by 369
Debugging the data plane with anteater
Mai, H., Khurshid, A., Agarwal, R., Caesar, M., Godfrey, P. B., & King, S. T. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018470 · Cited by 365
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
A Survey of BGP Security Issues and Solutions
Butler, K., Farley, T. R., McDaniel, P., & Rexford, J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2034031 · Cited by 350
Towards IP geolocation using delay and topology measurements
Katz-Bassett, E., John, J. P., Krishnamurthy, A., Wetherall, D., Anderson, T., & Chawathe, Y. (2006) · Proceedings of the 6th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1177080.1177090 · Cited by 346
Self-citationSampling 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
An information-theoretic approach to traffic matrix estimation
Zhang, Y., Roughan, M., Lund, C., & Donoho, D. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863990 · Cited by 303
On orchestrating virtual network functions
Bari, M. F., Chowdhury, S. R., Ahmed, R., & Boutaba, R. (2015) · 2015 11th International Conference on Network and Service Management (CNSM) · doi:10.1109/cnsm.2015.7367338 · Cited by 300
Enforcing Network-Wide Policies in the Presence of Dynamic Middlebox Actions using FlowTags
Fayaz, S. K., Chiang, L., Sekar, V., Yu, M., & Mogul, J. C. (2018) · doi:10.1184/r1/6468737 · Cited by 280
A Survey of Moving Target Defenses for Network Security
Sengupta, S., Chowdhary, A., Sabur, A., Alshamrani, A., Huang, D., & Kambhampati, S. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2982955 · Cited by 269
Floodless in seattle: a scalable ethernet architecture for large enterprises
Kim, C., Caesar, M., & Rexford, J. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402961 · Cited by 266
Network Coding for the Internet and Wireless Networks
Chou, P., & Wu, Y. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.904818 · Cited by 253
Lossless migrations of link-state IGPs
Vanbever, L., Vissicchio, S., Pelsser, C., Francois, P., & Bonaventure, O. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2012.2190767 · Cited by 46
Achieving Fast and Lightweight SDN Updates with Segment Routing
Luo, L., Yu, H., Luo, S., Zhang, M., & Yu, S. (2016) · 2016 IEEE Global Communications Conference (GLOBECOM) · doi:10.1109/glocom.2016.7841562 · Cited by 14
Metadata
- Authors
- Spring, N., Mahajan, R., & Wetherall, D.
- Venue
- Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
- Publisher
- ACM
- Published
- 2002-08-19
- Pages
- 133-145
- OpenAlex
- W2177058407
- Cited by
- 1,256
- References
- 16
- FWCI
- 35.96
- 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.