The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
On estimating end-to-end network path properties
Abstract
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the Internet, the transport protocol must often form its own estimates of network properties based on measurements performed by the connection endpoints. We consider two basic transport estimation problems: determining the setting of the retransmission timer (RTO) for a reliable protocol, and estimating the bandwidth available to a connection as it begins. We look at both of these problems in the context of TCP, using a large TCP measurement set [Pax97b] for trace-driven simulations. For RTO estimation, we evaluate a number of different algorithms, finding that the performance of the estimators is dominated by their minimum values, and to a lesser extent, the timer granularity, while being virtually unaffected by how often round-trip time measurements are made or the settings of the parameters in the exponentially-weighted moving average estimators commonly used. For bandwidth estimation, we explore techniques previously sketched in the literature [Hoe96, AD98] and find that in practice they perform less well than anticipated. We then develop a receiver-side algorithm that performs significantly better.
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
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
(2011) · SpringerReference · doi:10.1007/springerreference_27387 · Cited by 3,053
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Congestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
The macroscopic behavior of the TCP congestion avoidance algorithm
Mathis, M., Semke, J., Mahdavi, J., & Ott, T. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/263932.264023 · Cited by 1,495
The NewReno Modification to TCP's Fast Recovery Algorithm
Henderson, T., Floyd, S., Gurtov, A., & Nishida, Y. (2012) · doi:10.17487/rfc6582 · Cited by 1,410
Requirements for Internet Hosts - Communication Layers
(1989) · doi:10.17487/rfc1122 · Cited by 1,370
Recommendations on Queue Management and Congestion Avoidance in the Internet
Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., et al. (1998) · doi:10.17487/rfc2309 · Cited by 1,318
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
Cited by
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
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
Grieco, L. A., & Mascolo, S. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/997150.997155 · Cited by 293
On making TCP more robust to packet reordering
Blanton, E., & Allman, M. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/510726.510728 · Cited by 257
Self-citationA machine learning framework for TCP round-trip time estimation
Arouche Nunes, B. A., Veenstra, K., Ballenthin, W., Lukin, S., & Obraczka, K. (2014) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/1687-1499-2014-47 · Cited by 43
Metadata
- Authors
- Allman, M., & Paxson, V.
- Venue
- Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
- Publisher
- ACM
- Published
- 1999-08-30
- Pages
- 263-274
- OpenAlex
- W2105347639
- Cited by
- 344
- References
- 22
- FWCI
- 18.46
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On estimating end-to-end network path properties. https://app.cochat.ai/papers/10.1145/316188.316230
- The paper
- Allman, M., & Paxson, V. (1999). On estimating end-to-end network path properties. Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication. https://doi.org/10.1145/316188.316230
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.
