IEICE Transactions on Communications
Online ISSN : 1745-1345
Print ISSN : 0916-8516
Regular Section
Space Complexity of TCP for Persistent Packet Reordering
Chansook LIM
Author information
JOURNAL RESTRICTED ACCESS

2010 Volume E93.B Issue 6 Pages 1601-1604

Details
Abstract
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.
Content from these authors
© 2010 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top