A new TCP for persistent packet reordering

Authors:
Stephan Bohacek;Joao P. Hespanha;Junsoo Lee;Chansook Lim;Katia Obraczka
Affiliations:
Department of Electrical and Computer Engineering, University of Delaware, Newark, DE;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Computer Science, Sookmyung Women's University, Seoul, Korea;Department of Computer Science, University of Southern, California, Los Angeles, CA;Department of Computer Engineering, University of California, Santa Cruz, CA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2006

Citing 18
Cited 9

Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks

Computer Networks and ISDN Systems
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic

ACM SIGCOMM Computer Communication Review
End-to-end routing behavior in the Internet

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
End-to-end Internet packet dynamics

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Analysis of TCP performance over mobile ad hoc networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
On estimating end-to-end network path properties

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Packet reordering is not pathological network behavior

IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A comparison of TCP performance over three routing protocols for mobile ad hoc networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
The Eifel algorithm: making TCP robust against spurious retransmissions

ACM SIGCOMM Computer Communication Review
On making TCP more robust to packet reordering

ACM SIGCOMM Computer Communication Review
Improving TCP performance over mobile ad-hoc networks with out-of-order detection and response

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On the impact of alternate path routing for load balancing in mobile ad hoc networks

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Characterizing and measuring path diversity of internet topologies

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Variable Heavy Tailed Durations in Internet Traffic, Part I: Understanding Heavy Tails

MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Analytic models for the latency and steady-state throughput of TCP tahoe, Reno, and SACK

IEEE/ACM Transactions on Networking (TON)
TCP-DCR: A Novel Protocol for Tolerating Wireless Channel Errors

IEEE Transactions on Mobile Computing

An Overview of Packet Reordering in Transmission Control Protocol (TCP): Problems, Solutions, and Challenges

IEEE Transactions on Parallel and Distributed Systems
Fair link striping with FIFO delivery on heterogeneous channels

Computer Communications
Sorting Reordered Packets with Interrupt Coalescing

Computer Networks: The International Journal of Computer and Telecommunications Networking
On the effectiveness of proactive path-diversity based routing for robustness to path failures

NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Enhancing wireless TCP: a serialized-timer approach

INFOCOM'10 Proceedings of the 29th conference on Information communications
Multipath network flows: bounded buffers and jitter

INFOCOM'10 Proceedings of the 29th conference on Information communications
OSIA: Out-of-order Scheduling for In-order Arriving in concurrent multi-path transfer

Journal of Network and Computer Applications
Implementing information-theoretically secure oblivious transfer from packet reordering

ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Congestion control for sudden bandwidth changes in TCP

International Journal of Communication Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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-or-order acknowledgments) has no effect on TCP-PR's 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. In 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. Furthermore, TCP-PR only requires changes to the TCP sender side making it easier to deploy.