Abstract
The TCP Selective ACK (SACK) is used to notify information on the sequence space of the receiving buffer to the sender. By definition of RFC 2018, however, each SACK block has to be described by the two 32-bit unsigned integers, which may introduce significant extra load in the reverse ACK path when TCP connection is error-prone. Moreover, due to the 40-byte limitation of TCP option field, the available option space may not be sufficient to report all of the sequence blocks when the errors occur in a sudden burst. This may result in the unnecessary spurious retransmissions while the reverse SACK path is severely congested. To overcome such shortcomings, we propose a segment-based TCP SACK scheme in this paper. Both the theoretical analysis and simulation results show that the proposed scheme not only can significantly reduce the SACK overhead but also can avoid the unwanted spurious retransmissions in some specific error-prone scenarios.
Similar content being viewed by others
References
Allman, M., Glover, D., & Sanchez, L. (1999). Enhancing TCP over satellite channels using standard mechanisms. RFC 2488.
Allman, M., Paxson, V., & Blanton, E. (2009). TCP Congestion Control. IETF RFC 5681.
Balan, R. K., Lee, B. P., Kumar, K. R. R., Jacob, L., Seah, W. K. G., & Ananda, A. L. (2001). TCP HACK: TCP header checksum option to improve performance over Lossy links. In Proceedings of the IEEE INFOCOM 2001 (Vol. 1, pp. 309–318).
Blanton, E., Allman, M., Fall, K., & Wang, L. (2003). A conservative selective acknowledgment (SACK)-based loss recovery algorithm for TCP. IETF RFC 3517.
Cui, L., Song, J., Hong, C. S., & Koh, S. J. (2009). A segment based SACK scheme for wireless TCP. The 5th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM2009). Beijing, China. Sept 24–26.
Floyd, S., Mahdavi, J., Mathis, M., & Podolsky, M. (2000). An extension to the selective acknowledgement (SACK) option for TCP. IETF RFC 2883.
Jacobson, V., Braden, R., & Borman, D. (1992). TCP extensions for high performance. RFC 1323, IETF.
Mathis, M., Mahdavi, J., Floyd, S., & Romanow, A. (1996). TCP selective acknowledgment and options. RFC 2018, IETF.
Network Simulator (ns-2), available from http://www.isi.edu/nsnam/ns/.
Ramakrishnan, K. K., Floyd, S., & Black, S. (2001). The Addition of Explicit Congestion Notification (ECN) to IP. IETF RFC 3168.
Ramakrishnan, K. K. et al. (2005). ‘LT-TCP: End-to-End framework to improve TCP performance over networks with Lossy channels. Lecture Notes in Computer Science (Vol. 3552, pp. 81–93). Springer.
Sarolahti, P., & Kojo, M. (2005). Forward RTO-recovery (F-RTO): An algorithm for detecting spurious retransmission timeouts with TCP and the stream control transmission protocol (SCTP). IETF RFC 4138.
Srijith, K., Jacob, L., & Ananda, A. (2002). Worst-case performance limitation of TCP SACK and a feasible solution. In Proceedings of 8th IEEE International Conference on Communications Systems (ICCS).
Stevens, W. R. (1997). TCP slow start, congestion avoidance, fast retransmit, and fast recovery algorithms. RFC2001.
Author information
Authors and Affiliations
Corresponding author
Additional information
An erratum to this article can be found at http://dx.doi.org/10.1007/s11277-010-0160-z
Rights and permissions
About this article
Cite this article
Cui, L., Cui, X. & Lee, W.J. A Segment-Based SACK Scheme for TCP Over the Error-Prone Links. Wireless Pers Commun 61, 383–402 (2011). https://doi.org/10.1007/s11277-010-0028-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-010-0028-2