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 (β+1) × pipesize where β indicates the number of RTTs that must pass before packet loss is detected.
