TCP Selective Acknowledgment Options
Abstract
TCP may experience poor performance when multiple packets are lost from one window of data. With the limited information available from cumulative acknowledgments, a TCP sender can only learn about a single lost packet per round trip time. An aggressive sender could choose to retransmit packets early, but such retransmitted segments may have already been successfully received. A Selective Acknowledgment (SACK) mechanism, combined with a selective repeat retransmission policy, can help to overcome these limitations. The receiving TCP sends back SACK packets to the sender informing the sender of data that has been received. The sender can then retransmit only the missing data segments. This memo proposes an implementation of SACK and discusses its performance and related issues. Acknowledgements Much of the text in this document is taken directly from RFC1072 "TCP Extensions for Long-Delay Paths" by Bob Braden and Van Jacobson. The authors would like to thank Kevin Fall (LBNL), Christian...
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Their classifiers integrate two TCP variants that keep low control overhead for better performance over standard TCP-NewReno and TCP-SACK, and Burst-TCP for OBS networks.
“These classifiers integrate two TCP variants that keep a low control overhead for providing better performance (e.g. higher throughput and fewer timeouts) over the standard TCP-NewReno [185] and TCP-SACK [299], and Burst-TCP [490] for OBS networks.”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [299]
Cites
Congestion avoidance and control
Jacobson, V. L. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,956 · see citing works
TCP Extensions for High Performance
Jacobson, V. L., Braden, R., & Borman, D. (1992) · doi:10.17487/rfc1323 · Cited by 746 · see citing works
TCP extensions for long-delay paths
Jacobson, V. L., & Braden, R. (1988) · doi:10.17487/rfc1072 · Cited by 185 · see citing works
Xtp: The Xpress Transfer Protocol
Strayer, W. T., Dempsey, B. J., & Weaver, A. C. (1992) · Medical Entomology and Zoology · Cited by 176 · see citing works
NETBLT: A bulk data transfer protocol
Clark, D. D., Lambert, M. L., & Zhang, L. (1987) · doi:10.17487/rfc0998 · Cited by 87 · see citing works
Velten, D., Hinden, R. M., & Sax, J. (1984) · doi:10.17487/rfc0908 · Cited by 71 · see citing works
VMTP: Versatile Message Transaction Protocol
Cheriton, D. R. (1988) · Cited by 64 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Boutaba, R., Salahuddin, M. A., Limam, N., Ayoubi, S., Shahriar, N., Estrada-Solano, F., & Caicedo, O. M. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0087-2 · Cited by 1,036 · see citing works
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 · see citing works
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 · see citing works
SABUL: A Transport Protocol for Grid Computing
Gu, Y., & Grossman, R. (2003) · Journal of Grid Computing · doi:10.1023/b:grid.0000037553.18581.3b · Cited by 64 · see citing works
- Authors
- Mathis, M., Mahdavi, J., Floyd, S., & Romanow, A.
- Publisher
- RFC Editor
- Published
- 1996-10
- OpenAlex
- W4234789332
- Cited by
- 972
- References
- 7
- Citations by year
- 2026: 6 · 2025: 13 · 2024: 11 · 2023: 13 · 2022: 15 · 2021: 17 · 2020: 14 · 2019: 23 · 2018: 23 · 2017: 15 · 2016: 22 · 2015: 19 · 2014: 18 · 2013: 43 · 2012: 40
- Type
- report
- Language
- en
- Open access
- closed
- Funders
- Institut national de recherche en informatique et en automatique (INRIA)
- Lawrence Berkeley National Laboratory
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
- Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Networks and Protocols
- Physical Sciences › Computer Science › Computer Networks and Communications › Technology and Education Systems
- Keywords
- TCP, SACK, packet loss, TCP performance, TCP extensions
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
