• DocumentCode
    3239689
  • Title

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

  • Author

    Srijith, K.N. ; Jacob, Lillykutty ; Ananda, A.L.

  • Author_Institution
    Sch. of Comput., Nat. Univ. of Singapore, Singapore
  • Volume
    2
  • fYear
    2002
  • fDate
    25-28 Nov. 2002
  • Firstpage
    1152
  • 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.
  • Keywords
    packet switching; transport protocols; SACK mechanism implementation; TCP SACK; TCP options field; acknowledgment packets; error conditions; packet retransmission; received packets; selective acknowledgment; throughput; transmission control protocol; worst-case performance limitation; Analytical models; Control systems; Performance analysis; Proposals; Protocols; Satellites; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication Systems, 2002. ICCS 2002. The 8th International Conference on
  • Print_ISBN
    0-7803-7510-6
  • Type

    conf

  • DOI
    10.1109/ICCS.2002.1183313
  • Filename
    1183313