The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Heuristics for Internet map discovery
Abstract
Mercator is a program that uses hop-limited probes-the same primitive used in traceroute-to infer an Internet map. It uses informed random address probing to carefully exploring the IP address space when determining router adjacencies, uses source-route capable routers wherever possible to enhance the fidelity of the resulting map, and employs novel mechanisms for resolving aliases (interfaces belonging to the same router). This paper describes the design of these heuristics and our experiences with Mercator, and presents some preliminary analysis of the resulting Internet map.
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
Routing of multipoint connections
Waxman, B. M. (1988) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.12889 · Cited by 2,885
Border Gateway Protocol 3 (BGP-3)
Lougheed, K., & Rekhter, Y. (1991) · doi:10.17487/rfc1267 · Cited by 1,977
Requirements for Internet Hosts - Communication Layers
(1989) · doi:10.17487/rfc1122 · Cited by 1,370
Simple Network Management Protocol-SNMP
(2003) · Network Tutorial · doi:10.1201/9781482280876-123 · Cited by 1,158
Postel, J. B. (1981) · Cited by 1,130
Simple Network Management Protocol (SNMP)
Case, J. D., Fedor, M., Schoffstall, M. L., & Davin, J. (1990) · doi:10.17487/rfc1157 · Cited by 912
A Border Gateway Protocol 4 (BGP-4)
Rekhter, Y., & Li, T. (1995) · doi:10.17487/rfc1771 · Cited by 892
Postel, J. B. (1981) · doi:10.17487/rfc0791 · Cited by 802
End-to-end routing behavior in the Internet
Paxson, V. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649563 · Cited by 698
Lottery scheduling: flexible proportional-share resource management
Waldspurger, C. A., & Weihl, W. E. (1994) · doi:10.5555/1267638.1267639 · Cited by 637
Cited by
Opinion mining and sentiment analysis
Pang, B., & Lee, L. (2008) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000011 · Cited by 6,372
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
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
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
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
On inferring autonomous system relationships in the Internet
Gao, L. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.974527 · Cited by 1,070
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
Network support for IP traceback
Savage, S., Wetherall, D., Karlin, A., & Anderson, T. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929847 · Cited by 673
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
Graph mining: Laws, generators, and algorithms
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 609
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
Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
Li, L., Alderson, D., Doyle, J. C., & Willinger, W. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129111 · Cited by 519
An investigation of geographic mapping techniques for internet hosts
Padmanabhan, V. N., & Subramanian, L. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383073 · Cited by 479
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
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
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
Self-citationDefense 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
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
A survey of fault localization techniques in computer networks
Steinder, M. Ł., & Sethi, A. S. (2004) · Science of Computer Programming · doi:10.1016/j.scico.2004.01.010 · 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
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
Network Discovery and Verification
Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihaľák, M., & Ram, L. S. (2005) · Lecture Notes in Computer Science · doi:10.1007/11604686_12 · Cited by 351
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
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
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
Bipartite structure of all complex networks
Guillaume, J.-L., & Latapy, M. (2004) · Information Processing Letters · doi:10.1016/j.ipl.2004.03.007 · Cited by 255
Metadata
- Authors
- Govindan, R., & Tangmunarunkit, H.
- Venue
- Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
- Publisher
- IEEE
- Published
- 2002-11-07
- Volume
- 3
- Pages
- 1371-1380
- OpenAlex
- W2165084894
- Cited by
- 687
- References
- 15
- FWCI
- 43.56
- 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.