TCP-PR: TCP for persistent packet reordering

Most standard implementations of TCP perform poorly when packets are reordered. In this paper, we propose a new version of TCP that maintains high throughput when reordering occurs and yet, when packet reordering does not occur is friendly to other versions of TCP. The proposed TCP variant, or TCP-PR, does not rely on duplicate acknowledgments to detect a packet loss. Instead, timers are maintained to keep track of how long ago a packet was transmitted. In case the corresponding acknowledgment has not yet arrived and the elapsed time since the packet was sent is larger than a given threshold, the packet is assumed lost. Because TCP-PR does not rely on duplicate acknowledgments, packet reordering (including out-of-order acknowledgments) has no effect on TCP-PR performance. Through extensive simulations, we show that TCP-PR performs consistently better than existing mechanisms that try to make TCP more robust to packet reordering. When the case that packets are not reordered, we verify that TCP-PR maintains the same throughput as typical implementations of TCP (specifically, TCP-SACK) and shares network resources fairly.

[1]  Nitin H. Vaidya,et al.  Analysis of TCP Performance over Mobile Ad Hoc Networks , 1999, Wirel. Networks.

[2]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[3]  Sally Floyd,et al.  TCP Selective Acknowledgement Options , 1996 .

[4]  Sally Floyd,et al.  Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic , 1991, CCRV.

[5]  João P. Hespanha,et al.  TCP-PR : TCP for Persistent Packet Reordering ∗ Extended Version , 2002 .

[6]  Vern Paxson,et al.  Computing TCP's Retransmission Timer , 2000, RFC.

[7]  Feng Wang,et al.  Improving TCP performance over mobile ad-hoc networks with out-of-order detection and response , 2002, MobiHoc '02.

[8]  Biplab Sikdar,et al.  Analytic models and comparative study of the latency and steady-state throughput of TCP Tahoe, Reno and SACK , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[9]  Sally Floyd,et al.  An Extension to the Selective Acknowledgement (SACK) Option for TCP , 2000, RFC.

[10]  V. Paxson.  End-to-end routing behavior in the internet , 2006, CCRV.

[11]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[12]  Ming Zhang,et al.  RR-TCP: a reordering-robust TCP with DSACK , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[13]  Joao P. Hespanha,et al.  Preliminary results in routing games , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[14]  Mark Handley,et al.  Equation-based congestion control for unicast applications , 2000, SIGCOMM.

[15]  Kevin R. Fall,et al.  The NS Manual (Formerly NS Notes and Documentation , 2002 .

[16]  Mark Allman,et al.  On making TCP more robust to packet reordering , 2002, CCRV.

[17]  Randy H. Katz,et al.  The Eifel algorithm: making TCP robust against spurious retransmissions , 2000, CCRV.

[18]  Rajendra V. Boppana,et al.  A comparison of TCP performance over three routing protocols for mobile ad hoc networks , 2001, MobiHoc '01.

[19]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM.

[20]  Biplab Sikdar,et al.  Analytic models for the latency and steady-state throughput of TCP tahoe, Reno, and SACK , 2003, TNET.

[21]  Vern Paxson,et al.  End-to-end Internet packet dynamics , 1997, SIGCOMM '97.

[22]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[23]  Joao P. Hespanha,et al.  Saddle policies for secure routing in communication networks , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..