The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
End-to-end Internet packet dynamics
Abstract
We discuss findings from a large-scale study of Internet packet dynamics conducted by tracing 20000 TCP bulk transfers between 35 Internet sites. Because we traced each 100-kbyte transfer at both the sender and the receiver, the measurements allow us to distinguish between the end-to-end behavior due to the different directions of the Internet paths, which often exhibit asymmetries. We: (1) characterize the prevalence of unusual network events such as out-of-order delivery and packet replication; (2) discuss a robust receiver-based algorithm for estimating "bottleneck bandwidth" that addresses deficiencies discovered in techniques based on "packet pair;" (3) investigate patterns of packet loss, finding that loss events are not well modeled as independent and, furthermore, that the distribution of the duration of loss events exhibits infinite variance; and (4) analyze variations in packet transit delays as indicators of congestion periods, finding that congestion periods also span a wide range of time scales.
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
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Willinger, W., Taqqu, M. S., Sherman, R., & Wilson, D. V. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.554723 · Cited by 1,654
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190317 · Cited by 1,198
Simulation-based comparisons of Tahoe, Reno and SACK TCP
Fall, K., & Floyd, S. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/235160.235162 · Cited by 1,148
Wide-area Internet traffic patterns and characteristics
Thompson, K., Miller, G. J., & Wilder, R. (1997) · IEEE Network · doi:10.1109/65.642356 · Cited by 1,074
A control-theoretic approach to flow control
Keshav, S. (1991) · Proceedings of the conference on Communications architecture & protocols · doi:10.1145/115992.115995 · Cited by 752
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
End-to-end routing behavior in the Internet
Paxson, V. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649563 · Cited by 698
Self-citation
Cited by
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-citationAllman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Self-citationEfficient authentication and signing of multicast streams over lossy channels
Perrig, A., Canetti, R., Tygar, J. D., & Song, D. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848446 · Cited by 946
End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput
Jain, M., & Dovrolis, C. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.815304 · Cited by 770
Snoeren, 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
Bandwidth estimation: metrics, measurement techniques, and tools
Prosad, R., Davrolis, C., Murray, M., & Claffy, K. C. (2003) · IEEE Network · doi:10.1109/mnet.2003.1248658 · Cited by 728
Difficulties in simulating the Internet
Floyd, S., & Paxson, V. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.944338 · Cited by 721
Self-citationPerformance Enhancing Proxies Intended to Mitigate Link-Related Degradations
Border, J., Kojo, M., Griner, J., Montenegro, G., & Shelby, Z. (2001) · doi:10.17487/rfc3135 · Cited by 596
The BLUE active queue management algorithms
Feng, W.-C., Shin, K. G., Kandlur, D. D., & Saha, D. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801399 · Cited by 576
Coates, A., Hero III, A. O., Nowak, R., & Yu, B. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.998081 · Cited by 529
Delayed Internet routing convergence
Labovitz, C., Ahuja, A., Bose, A., & Jahanian, F. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347428 · Cited by 491
Low-rate TCP-targeted denial of service attacks: the shrew vs. the mice and elephants
Kuzmanovic, A., & Knightly, E. W. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863966 · Cited by 489
On the constancy of internet path properties
Zhang, Y., & Duffield, N. (2001) · Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement - IMW '01 · doi:10.1145/505202.505228 · Cited by 466
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Schwartz, B., Kent, S. T., & Strayer, W. T. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.804827 · Cited by 450
UDT: UDP-based data transfer for high-speed wide area networks
Gu, Y., & Grossman, R. L. (2007) · Computer Networks · doi:10.1016/j.comnet.2006.11.009 · Cited by 414
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
Dynamic load balancing without packet reordering
Kandula, S., Katabi, D., Sinha, S., & Berger, A. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1232919.1232925 · Cited by 402
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
ELK, a new protocol for efficient large-group key distribution
Penrig, A., Song, D., & Tygar, D. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924302 · Cited by 354
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
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-citationOn multiple description streaming with content delivery networks
Apostolopoulos, J., Wong, T., Tan, W.-T., & Wee, S. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019427 · Cited by 323
QRON: QoS-Aware Routing in Overlay Networks
Li, Z., & Mohapatra, P. (2004) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.818782 · Cited by 286
Is it still possible to extend TCP?
Honda, M., Nishida, Y., Raiciu, C., Greenhalgh, A., Handley, M., & Tokuda, H. (2011) · Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference · doi:10.1145/2068816.2068834 · Cited by 272
DNS performance and the effectiveness of caching
Jung, J., Sit, E., Balakrishnan, H., & Morris, R. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.803905 · Cited by 182
A Machine Learning Approach to TCP Throughput Prediction
Mirza, M., Sommers, J., Barford, P., & Zhu, X. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2009.2037812 · Cited by 132
Bayesian packet loss detection for TCP
I'onseca, N., & Crovella, M. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498462 · Cited by 27
Metadata
- Authors
- Paxson, V.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1999-06
- Volume
- 7
- Issue
- 3
- Pages
- 277-292
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2152112690
- Cited by
- 908
- References
- 18
- FWCI
- 87.70
- 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.