Space Complexity of TCP for Persistent Packet Reordering

초록

This letter investigates the space complexity of the sender buffer in a TCP variant, TCP-PR, to deal with packet reordering. Our finding is that with the SACK option used, TCP-PR requires the sender buffer of (beta + 1) x pipesize where beta indicates the number of RTTs that must pass before packet loss is detected.

키워드