The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
End-to-end routing behavior in the Internet
Abstract
The large-scale behavior of routing In the Internet has gone virtually without any formal study, the exceptions being Chinoy's (1993) analysis of the dynamics of Internet routing information, and work, similar in spirit, by Labovitz, Malan, and Jahanian (see Proc. SIGCOMM'97, 1997). We report on an analysis of 40000 end-to-end route measurements conducted using repeated "traceroutes" between 37 Internet sites. We analyze the routing behavior for pathological conditions, routing stability, and routing symmetry. For pathologies, we characterize the prevalence of routing loops, erroneous routing, infrastructure failures, and temporary outages. We find that the likelihood of encountering a major routing pathology more than doubled between the end of 1994 and the end of 1995, rising from 1.5% to 3.3%. For routing stability, we define two separate types of stability, "prevalence", meaning the overall likelihood that a particular route is encountered, and "persistence", the likelihood that a route remains unchanged over a long period of time. We find that Internet paths are heavily dominated by a single prevalent route, but that the time periods over which routes persist show wide variation, ranging from seconds up to days. About two-thirds of the Internet paths had routes persisting for either days or weeks. For routing symmetry, we look at the likelihood that a path through the Internet visits at least one different city in the two directions. At the end of 1995, this was the case half the time, and at least one different autonomous system was visited 30% of the time.
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
Ross, S. M. (1982) · Cited by 3,812
Integrated Services in the Internet Architecture: an Overview
Braden, R., Clark, D., & Shenker, S. (1994) · doi:10.17487/rfc1633 · Cited by 3,145
Mathematical Statistics and Data Analysis
Rabinowitz, L. (1989) · Technometrics · doi:10.1080/00401706.1989.10488573 · Cited by 3,116
Border Gateway Protocol 3 (BGP-3)
Lougheed, K., & Rekhter, Y. (1991) · doi:10.17487/rfc1267 · Cited by 1,977
Multicast routing in datagram internetworks and extended LANs
Deering, S. E., & Cheriton, D. R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/78952.78953 · Cited by 1,173
A Border Gateway Protocol 4 (BGP-4)
Rekhter, Y., & Li, T. (1995) · doi:10.17487/rfc1771 · Cited by 892
Network Time Protocol (Version 3) Specification, Implementation and Analysis
Mills, D. L. (1992) · doi:10.17487/rfc1305 · Cited by 851
End-to-end packet delay and loss behavior in the internet
Bolot, J.-C. (1993) · Conference proceedings on Communications architectures, protocols and applications · doi:10.1145/166237.166265 · Cited by 729
The New Routing Algorithm for the ARPANET
McQuillan, J., Richer, I., & Rosen, E. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094721 · Cited by 686
Empirically derived analytic models of wide-area TCP connections
Paxson, V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.330413 · Cited by 581
Self-citation
Cited by
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
Bro: a system for detecting network intruders in real-time
Paxson, V. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00112-7 · Cited by 2,636
Self-citationResilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
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
End-to-end Internet packet dynamics
Paxson, V. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.779192 · Cited by 908
Self-citationAccurate, scalable in-network identification of p2p traffic using application signatures
Sen, S., Spatscheck, O., & Wang, D. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988742 · Cited by 807
Difficulties in simulating the Internet
Floyd, S., & Paxson, V. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.944338 · Cited by 721
Self-citationHeuristics 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
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
Packet-level traffic measurements from the sprint IP backbone
Fraleigh, C., Moon, S., Lyles, B., Cotton, C., Khan, M., Moll, D., Rockell, R., Seely, T., & Diot, C. (2003) · IEEE Network · doi:10.1109/mnet.2003.1248656 · Cited by 639
A measurement study of available bandwidth estimation tools
Strauss, J., Katabi, D., & Kaashoek, F. (2003) · Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement - IMC '03 · doi:10.1145/948205.948211 · Cited by 626
End-to-end Internet packet dynamics
Paxson, V. (1997) · Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/263105.263155 · Cited by 542
Self-citationThe end-to-end effects of Internet path selection
Savage, S., Collins, A., Hoffman, E., Snell, J., & Anderson, T. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316233 · Cited by 473
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
Characterization of failures in an IP backbone
Markopoulou, A., Iannaccone, G., Bhattacharyya, S., Chuah, C.-N., & Diot, C. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354653 · Cited by 430
Multicast-based inference of network-internal loss characteristics
Cascares, Duffield, Horowitz, & Towsley (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796384 · Cited by 410
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
On the origin of power laws in Internet topologies
Medina, A., Matta, I., & Byers, J. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505680.505683 · Cited by 406
Packet reordering is not pathological network behavior
Bennett, J. C. R., Partridge, C., & Shectman, N. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811445 · Cited by 402
The Eifel algorithm: making TCP robust against spurious retransmissions
Ludwig, R., & Katz, R. H. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505688.505692 · 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
An analysis of BGP convergence properties
Griffin, T. G., & Wilfong, G. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316231 · Cited by 369
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
Characterizing residential broadband networks
Dischinger, M., Haeberlen, A., Gummadi, K. P., & Saroiu, S. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298313 · Cited by 341
On the characteristics and origins of internet flow rates
Zhang, Y., Breslau, L., Paxson, V., & Shenker, S. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633055 · Cited by 325
Self-citationAll-optical signal processing using /spl chi//sup (2)/ nonlinearities in guided-wave devices
Langrock, C., Kumar, S., McGeehan, J. E., Willner, A. E., & Fejer, M. M. (2006) · Journal of Lightwave Technology · doi:10.1109/jlt.2006.874605 · Cited by 267
SAVE: source address validity enforcement protocol
Li, J., Mirkovic, J., Wang, M., Reiher, P., & Zhang, L. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019407 · Cited by 255
Locating internet routing instabilities
Feldmann, A., Maennel, O., Mao, Z. M., Berger, A., & Maggs, B. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015491 · Cited by 252
California fault lines: understanding the causes and impact of network failures
Turner, D., Levchenko, K., Snoeren, A. C., & Savage, S. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851220 · Cited by 164
Metadata
- Authors
- Paxson, V.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1997
- Volume
- 5
- Issue
- 5
- Pages
- 601-615
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2141487810
- Cited by
- 698
- References
- 20
- FWCI
- 48.21
- 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.