Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Space Complexity of TCP for Persistent Packet Reordering
- Authors
- Lim, Chansook
- Issue Date
- Jun-2010
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- TCP; packet reordering; sender buffer; space complexity
- Citation
- IEICE TRANSACTIONS ON COMMUNICATIONS, v.E93B, no.6, pp.1601 - 1604
- Journal Title
- IEICE TRANSACTIONS ON COMMUNICATIONS
- Volume
- E93B
- Number
- 6
- Start Page
- 1601
- End Page
- 1604
- ISSN
- 0916-8516
- 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 (beta + 1) x pipesize where beta indicates the number of RTTs that must pass before packet loss is detected.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Lim, Chan sook
- Science & Technology (Department of Software and Communications Engineering)