S. Floyd, "Issues with TCP SACK", Technical Report, LBL Network Group, 1996.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
Worst-Case Performance Limitation Of TCP SACK And a.. - Nair, Jacob, Ananda (2003)   (Correct)

....In one paper [5] Floyd and Fall analyzed the performance of TCP SACK with respect to Tahoe and New Reno using simulations, and found that SACK was able to provide better performance. In [6] Allman et al. discussed the performance of TCP SACK over satellite links. III. LIMITATIONS OF SACK In [7], Floyd addressed various issues related to the behavior and performance of TCP SACK. One important limitation mentioned by the author is that TCP SACK requires 64 bits (8 bytes) to represent the upper and lower bound sequence numbers of every block it selectively acknowledges. Since TCP protocol ....

....This rather small maximum number of SACK block information can lead to efficiency problems in the performance of TCP. Under certain packet loss scenarios, the TCP sender will end up retransmitting packets that have already been received successfully. An example of such a situation is described in [7], which is reproduced here as it forms an interesting scenario for our simulations. In this scenario, it is assumed that there is at least a congestion window of 11 packets, with at least a loss of four data and three ACK packets. Table 1 describes the scenario in more detail. Table 1. The Error ....

S. Floyd, "Issues with TCP SACK", Technical Report, LBL Network Group, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC