The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput
Abstract
The available bandwidth (avail-bw) in a network path is of major importance in congestion control, streaming applications, quality-of-service verification, server selection, and overlay networks. We describe an end-to-end methodology, called self-loading periodic streams (SLoPS), for measuring avail-bw. The basic idea in SLoPS is that the one-way delays of a periodic packet stream show an increasing trend when the stream's rate is higher than the avail-bw. We have implemented SLoPS in a tool called pathload. The accuracy of the tool has been evaluated with both simulations and experiments over real-world Internet paths. Pathload is nonintrusive, meaning that it does not cause significant increases in the network utilization, delays, or losses. We used pathload to evaluate the variability ("dynamics") of the avail-bw in Internet paths. The avail-bw becomes significantly more variable in heavily utilized paths, as well as in paths with limited capacity (probably due to a lower degree of statistical multiplexing). We finally examine the relation between avail-bw and TCP throughput. A persistent TCP connection can be used to measure roughly the avail-bw in a path, but TCP saturates the path and increases significantly the path delays and jitter.
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
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
On the self-similar nature of Ethernet traffic (extended version)
Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.282603 · Cited by 5,233
Congestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
Andersen, D., Balakrishnan, H., Kaashoek, F., & Morris, R. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502048 · Cited by 1,868
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
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
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
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190317 · Cited by 698
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
Improving the start-up behavior of a congestion control scheme for TCP
Hoe, J. C. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248180 · Cited by 461
On estimating end-to-end network path properties
Allman, M., & Paxson, V. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316230 · Cited by 344
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
Jain, R. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/74681.74686 · Cited by 319
Using pathchar to estimate Internet link characteristics
Downey, A. B. (1999) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/301453.301582 · Cited by 316
Analyzing stability in wide-area network performance
Balakrishnan, H., Stemm, M., Seshan, S., & Katz, R. H. (1997) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/258612.258631 · Cited by 142
Dynamic adaptive windows for high speed data networks: theory and simulations
Mitra, D., & Seery, J. B. (1990) · ACM SIGCOMM Symposium on Communications Architectures and Protocols (SIGCOMM) · doi:10.1145/99508.99527 · Cited by 92
A Framework for Defining Empirical Bulk Transfer Capacity Metrics
Mathis, M., & Allman, M. C. (2001) · doi:10.17487/rfc3148 · Cited by 76
Cited by
Binary increase congestion control (BIC) for fast long-distance networks
Xu, L., Harfoush, K., & Rhee, I. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354672 · Cited by 959
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
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
Unreeling netflix: Understanding and improving multi-CDN movie delivery
Adhikari, V. K., Guo, Y., Hao, F., Varvello, M., Hilt, V., Steiner, M., & Zhang, Z.-L. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195531 · Cited by 374
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
Metadata
- Authors
- Jain, M., & Dovrolis, C.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2003-08
- Volume
- 11
- Issue
- 4
- Pages
- 537-549
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2161630099
- Cited by
- 770
- References
- 17
- FWCI
- 91.22
- 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.