The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Modeling TCP Reno performance: a simple model and its empirical validation
Abstract
The steady-state performance of a bulk transfer TCP flow (i.e., a flow with a large amount of data to send, such as FTP transfers) may be characterized by the send rate, which is the amount of data sent by the sender in unit time. In this paper we develop a simple analytic characterization of the steady-state send rate as a function of loss rate and round trip time (RTT) for a bulk transfer TCP flow. Unlike the models of Lakshman and Madhow (see IEE/ACM Trans. Networking, vol.5, p.336-50, 1997), Mahdavi and Floyd (1997), Mathis, Semke, Mahdavi and Ott (see Comput. Commun. Rev., vol.27, no.3, 1997) and by by Ott et al., our model captures not only the behavior of the fast retransmit mechanism but also the effect of the time-out mechanism. Our measurements suggest that this latter behavior is important from a modeling perspective, as almost all of our TCP traces contained more time-out events than fast retransmit events. Our measurements demonstrate that our model is able to more accurately predict TCP send rate and is accurate over a wider range of loss rates. We also present a simple extension of our model to compute the throughput of a bulk transfer TCP flow, which is defined as the amount of data received by the receiver in unit 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
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
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
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
TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms
Stevens, W. (1997) · doi:10.17487/rfc2001 · Cited by 1,143
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
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
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
Self-citationEnd-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
TCP-like congestion control for layered multicast data transfer
Vicisano, L., Crowcroft, J., & Rizzo, L. (2002) · doi:10.1109/infcom.1998.662909 · Cited by 522
Bandwidth modelling for network-aware applications
Bolliger, J., Gross, T., & Hengartner, U. (1999) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1999.752148 · Cited by 45
Cited by
Scalable TCP: improving performance in highspeed wide area networks
Kelly, T. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/956981.956989 · Cited by 869
A positive systems model of TCP-like congestion control: asymptotic results
Shorten, R., Wirth, F., & Leith, D. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.876178 · Cited by 501
Measuring the quality of experience of HTTP video streaming
Mok, R. K. P., Chan, E. W. W., & Chang, R. K. C. (2011) · 12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops · doi:10.1109/inm.2011.5990550 · Cited by 473
Rate adaptation for adaptive HTTP streaming
Liu, C., Bouazizi, I., & Gabbouj, M. (2011) · Proceedings of the second annual ACM conference on Multimedia systems · doi:10.1145/1943552.1943575 · Cited by 461
End-to-end congestion control schemes: utility functions, random losses and ecn marks
Kunniyur, S., & Srikant, R. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818183 · Cited by 448
TCP Hybla: a TCP enhancement for heterogeneous networks
Caini, C., & Firrincieli, R. (2004) · International Journal of Satellite Communications and Networking · doi:10.1002/sat.799 · Cited by 409
End-to-end performance and fairness in multihop wireless backhaul networks
Gambiroza, V., Sadeghi, B., & Knightly, E. W. (2004) · Proceedings of the 10th annual international conference on Mobile computing and networking · doi:10.1145/1023720.1023749 · Cited by 386
ATL: An Adaptive Transport Layer Suite for Next-Generation Wireless Internet
Akan, O. B., & Akyildiz, I. F. (2004) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.826919 · Cited by 75
El Khayat, I., Geurts, P., & Leduc, G. (2010) · Wireless Networks · doi:10.1007/s11276-008-0129-y · Cited by 34
Improving TCP in Wireless Networks with an Adaptive Machine-Learnt Classifier of Packet Loss Causes
El Khayat, I., Geurts, P., & Leduc, G. (2005) · Lecture Notes in Computer Science · doi:10.1007/11422778_44 · Cited by 20
Machine-learnt versus analytical models of TCP throughput
El Khayat, I., Geurts, P., & Leduc, G. (2007) · Computer Networks · doi:10.1016/j.comnet.2006.11.017 · Cited by 10
Metadata
- Authors
- Padhye, J., Firoiu, V., Towsley, D. F., & Kurose, J. F.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2000-04
- Volume
- 8
- Issue
- 2
- Pages
- 133-145
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2140490525
- Cited by
- 1,184
- References
- 10
- FWCI
- 56.80
- 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.