Worst-case performance limitation of TCP SACK and a feasible solution

Authors:
K. N. Srijith;L. Jacob;A. L. Ananda
Affiliations:
Sch. of Comput., Nat. Univ. of Singapore, Singapore;Sch. of Comput., Nat. Univ. of Singapore, Singapore;Sch. of Comput., Nat. Univ. of Singapore, Singapore
Venue:
ICCS '02 Proceedings of the The 8th International Conference on Communication Systems - Volume 02
Year:
2002

Citing 0
Cited 2

A segment based SACK scheme for wireless TCP

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A Segment-Based SACK Scheme for TCP Over the Error-Prone Links

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

In the present implementation of the transmission control protocol (TCP) selective acknowledgment (SACK), every SACK block needs 8 bytes to carry information about the received packets, back to the sender. Since TCP options field has a fixed length, there is a limit on the number of SACK block that can be carried by the acknowledgment packets. Under some error conditions, this limitation can force the TCP sender to retransmit packets that have already been received successfully by the receiver. This paper puts forward a proposal to modify the present SACK implementation, in order to prevent these unwanted retransmissions. We show that the proposed implementation of SACK mechanism increases the throughput of SACK enabled TCP connections.