The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
End-to-end packet delay and loss behavior in the internet
Open accessAbstract
We use the measured round trip delays of small UDP probe packets sent at regular time intervals to analyze the end-to-end packet delay and loss behavior in the Internet. By varying the interval between probe packets, it is possible to study the structure of the Internet load over different time scales. In this paper, the time scales of interest range from a few milliseconds to a few minutes. Our observations agree with results obtained by others using simulation and experimental approaches. For example, our estimates of Internet workload are consistent with the hypothesis of a mix of bulk traffic with larger packet size, and interactive traffic with smaller packet size. We observe compression (or clustering) of the probe packets, rapid fluctuations of queueing delays over small intervals, etc. Our results also show interesting and less expected behavior. For example, we find that the losses of probe packets are essentially random unless the probe traffic uses a large fraction of the available bandwidth. We discuss the implications of these results on the design of control mechanisms for the Internet.
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
Time Series Analysis: Forecasting and Control
Geurts, M., Box, G. E. P., & Jenkins, G. M. (1977) · Journal of Marketing Research · doi:10.2307/3150485 · Cited by 19,186
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
Queueing Systems, Volume 2: Computer Applications
Stern, G., & Kleinrock, L. (1976) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2346953 · Cited by 1,038
Clark, D. D., Shenker, S., & Zhang, L. (1992) · Conference proceedings on Communications architectures & protocols - SIGCOMM '92 · doi:10.1145/144179.144199 · Cited by 851
The design philosophy of the DARPA internet protocols
Clark, D. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52336 · Cited by 655
The design philosophy of the DARPA Internet Protocols
Clark, D. D. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205458 · Cited by 396
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
Zhang, L., Shenker, S., & Clark, D. D. (1991) · Proceedings of the conference on Communications architecture & protocols · doi:10.1145/115992.116006 · Cited by 375
Traffic phase effects in packet-switched gateways
Floyd, S., & Jacobson, V. (1991) · ACM SIGCOMM Computer Communication Review · doi:10.1145/122419.122421 · Cited by 335
Improving round-trip time estimates in reliable transport protocols
Karn, P., & Partridge, C. (1991) · ACM Transactions on Computer Systems · doi:10.1145/118544.118549 · Cited by 179
Cited by
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
Lakshman, T. V., & Madhow, U. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.611099 · Cited by 928
End-to-end Internet packet dynamics
Paxson, V. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.779192 · Cited by 908
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
End-to-end routing behavior in the Internet
Paxson, V. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649563 · Cited by 698
Measurement and modelling of the temporal dependence in packet loss
Yajnik, M., Moon, S., Kurose, J., & Towsley, D. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749301 · Cited by 590
Measurements and analysis of end-to-end Internet dynamics
Paxson, V. (1997) · doi:10.2172/551971 · Cited by 572
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
vic: a flexible framework for packet video
McCanne, S., & Jacobson, V. (1995) · Proceedings of the third ACM international conference on Multimedia - MULTIMEDIA '95 · doi:10.1145/217279.215315 · Cited by 490
The 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
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
Measuring and analyzing the characteristics of Napster and Gnutella hosts
Saroiu, S., Gummadi, K. P., & Gribble, S. D. (2003) · Multimedia Systems · doi:10.1007/s00530-003-0088-1 · Cited by 383
Adaptive FEC-based error control for Internet telephony
Bolot, J.-C., Fosse-Parisis, S., & Towsley, D. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.752166 · Cited by 353
Self-citationReliability in wireless sensor networks: A survey and challenges ahead
Mahmood, M. A., Seah, W. K. G., & Welch, I. (2015) · Computer Networks · doi:10.1016/j.comnet.2014.12.016 · Cited by 342
Timing Attacks in Low-Latency Mix Systems
Levine, B. N., Reiter, M. K., Wang, C., & Wright, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27809-2_25 · Cited by 277
Flexible time management in data stream systems
Srivastava, U., & Widom, J. (2004) · Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1055558.1055596 · Cited by 275
Timely and Continuous Machine-Learning-Based Classification for Interactive IP Traffic
Nguyen, T. T. T., Armitage, G., Branch, P., & Zander, S. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2012.2187305 · Cited by 156
Mac-layer packet loss models for wi-fi networks: A survey
Silva, C. A. G. D., & Pedroso, C. M. (2019) · IEEE Access · doi:10.1109/access.2019.2958260 · Cited by 49
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
“This assumption is justi£ed by the generally adopted droptail queuing discipline by many Internet routers, as is discussed in [24], [13], [14].”
Method
Metadata
- Authors
- Bolot, J.-C.
- Venue
- Conference proceedings on Communications architectures, protocols and applications
- Publisher
- ACM
- Published
- 1993-10
- Pages
- 289-298
- OpenAlex
- W2069499077
- Cited by
- 729
- References
- 13
- FWCI
- 7.25
- Type
- conference paper
- Language
- en
- Open access
- gold
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.