Simulation-based comparisons of Tahoe, Reno and SACK TCP
Open accessThe DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Abstract
This paper uses simulations to explore the benefits of adding selective acknowledgments (SACK) and selective repeat to TCP. We compare Tahoe and Reno TCP, the two most common reference implementations for TCP, with two modified versions of Reno TCP. The first version is New-Reno TCP, a modified version of TCP without SACK that avoids some of Reno TCP's performance problems when multiple packets are dropped from a window of data. The second version is SACK TCP, a conservative extension of Reno TCP modified to use the SACK option being proposed in the Internet Engineering Task Force (IETF). We describe the congestion control algorithms in our simulated implementation of SACK TCP and show that while selective acknowledgments are not required to solve Reno TCP's performance problems when multiple packets are dropped, the absence of selective acknowledgments does impose limits to TCP's ultimate performance. In particular, we show that without selective acknowledgments, TCP implementations are constrained to either retransmit at most one dropped packet per round-trip time, or to retransmit packets that might have already been successfully delivered.
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
Self-citationCongestion 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
A comparison of mechanisms for improving TCP performance over wireless links
Balakrishnan, H., Padmanabhan, V. N., Seshan, S., & Katz, R. H. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650137 · Cited by 1,395
TCP Extensions for High Performance
Borman, D., Braden, B., & Jacobson, V. (2014) · doi:10.17487/rfc7323 · Cited by 1,010
TCP Selective Acknowledgment Options
Mathis, M., Mahdavi, J., Floyd, S., & Romanow, A. (1996) · doi:10.17487/rfc2018 · Cited by 972
Self-citationImproving 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
A comparison of mechanisms for improving TCP performance over wireless links
Balakrishnan, H., Padmanabhan, V. N., Seshan, S., & Katz, R. H. (1996) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/248156.248179 · Cited by 322
Forward acknowledgement: refining TCP congestion control
Mathis, M., & Mahdavi, J. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248181 · Cited by 228
TCP extensions for long-delay paths
Jacobson, V., & Braden, R. T. (1988) · doi:10.17487/rfc1072 · Cited by 185
Cited by
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Modeling TCP throughput: a simple model and its empirical validation
Padhye, J., Firoiu, V., Towsley, D., & Kurose, J. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285291 · Cited by 2,106
Promoting the use of end-to-end congestion control in the Internet
Floyd, S., & Fall, K. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793002 · Cited by 1,646
Self-citationThe 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
Self-citationA comparison of mechanisms for improving TCP performance over wireless links
Balakrishnan, H., Padmanabhan, V. N., Seshan, S., & Katz, R. H. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650137 · Cited by 1,395
Modeling TCP Reno performance: a simple model and its empirical validation
Padhye, J., Firoiu, V., Towsley, D. F., & Kurose, J. F. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.842137 · Cited by 1,184
End-to-end Internet packet dynamics
Paxson, V. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.779192 · Cited by 908
Dynamics of random early detection
Lin, D., & Morris, R. (1997) · Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/263105.263154 · Cited by 793
Difficulties in simulating the Internet
Floyd, S., & Paxson, V. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.944338 · Cited by 721
Self-citationModeling TCP throughput: a simple model and its empirical validation
Padhye, J., Firoiu, V., Towsley, D., & Kurose, J. (1998) · ACM SIGCOMM Computer Communication Review · doi:10.1145/285243.285291 · Cited by 716
RAP: An end-to-end rate-based congestion control mechanism for realtime streams in the Internet
Rejaie, R., Handley, M., & Estrin, 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.752152 · Cited by 710
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
TCP Veno: TCP enhancement for transmission over wireless access networks
Fu, C. P., & Liew, S. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.807336 · Cited by 536
Roughan, M., Sen, S., Spatscheck, O., & Duffield, N. (2004) · Proceedings of the 4th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1028788.1028805 · Cited by 494
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
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
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
Enhancing TCP Over Satellite Channels using Standard Mechanisms
Allman, M., Glover, D., & Sanchez, L. (1999) · doi:10.17487/rfc2488 · Cited by 382
General AIMD congestion control
Yang, Y. R., & Lam, S. S. (2002) · Proceedings 2000 International Conference on Network Protocols · doi:10.1109/icnp.2000.896303 · Cited by 370
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
TCP in wireless environments: problems and solutions
Tian, Y., Xu, K., & Ansari, N. (2005) · IEEE Communications Magazine · doi:10.1109/mcom.2005.1404595 · Cited by 333
TCP-Peach: a new congestion control scheme for satellite IP networks
Akyildiz, I. F., Morabito, G., & Palazzo, S. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929853 · Cited by 302
Comparative performance analysis of versions of TCP in a local network with a lossy link
Kumar, A. (1998) · IEEE/ACM Transactions on Networking · doi:10.1109/90.720921 · Cited by 299
Ongoing TCP Research Related to Satellites
Dawkins, S., Glover, D., Griner, J., Tran, D., Henderson, T., Heidemann, J., Touch, J., Kruse, H., Ostermann, S., Scott, K., et al. (2000) · doi:10.17487/rfc2760 · Cited by 284
Transport protocols for Internet-compatible satellite networks
Henderson, T. R., & Katz, R. H. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.748815 · Cited by 280
Denial of service resilience in ad hoc networks
Aad, I., Hubaux, J.-P., & Knightly, E. W. (2004) · Proceedings of the 10th annual international conference on Mobile computing and networking · doi:10.1145/1023720.1023741 · Cited by 279
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
TCP behavior of a busy Internet server: analysis and improvements
Balakrishnan, H., Padmanabhan, V. N., Seshan, S., Stemm, M., & Katz, R. H. (2002) · Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98CH36169) · doi:10.1109/infcom.1998.659661 · Cited by 257
Semke, J., Mahdavi, J., & Mathis, M. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285292 · Cited by 253
TCP implementations and false time out detection in OBS networks
Yu, X., Qiao, C., & Liu, Y. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1356966 · Cited by 92
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 supported by simulation and TCP trace analysis evidences found in [21], [13].”
Result
Metadata
- Authors
- Fall, K., & Floyd, S.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 1996-07
- Volume
- 26
- Issue
- 3
- Pages
- 5-21
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2021512083
- Cited by
- 1,148
- References
- 16
- FWCI
- 51.50
- Type
- journal article
- Language
- en
- Open access
- bronze
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.