Is TCP packet reordering always harmful?

IP networks do not provide any guarantee that packets belonging to the same flow are delivered in the correct order. Out-of-order reception of packets was commonly considered due to pathological network conditions (such as link failures, etc.). However, it has been shown that packet reordering is a phenomenon which occurs even in normal network operation, due to a number of link-level and/or router-level implementation features, such as local parallelism and load balancing. Packet reordering is intuitively considered as a negative phenomenon, which may severely affect TCP traffic performance since it is expected to cause inefficient usage of the available link bandwidth and is expected to induce bursty transmission behaviour. We show that a limited amount of reordering can, instead, improve network performance. To the best of our knowledge, this is the first claim that TCP packet reordering, rather than being harmful, may be a beneficial phenomenon in terms of overall network performance. In order to justify this, perhaps counter-intuitive, result, in addition to simulation results, we present a theoretical justification, by providing an analogy with the performance improvements experienced when TCP flows encounter a small dropping probability.

[1]  Giovanni Neglia,et al.  Performance evaluation of a new adaptive packet marking scheme for TCP over DiffServ networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[2]  Farouk Kamoun,et al.  Queueing Analysis of the Ordering Issue in a Distributed Database Concurrency Control Mechanism , 1981, ICDCS.

[3]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[4]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[5]  Donald F. Towsley,et al.  A control theoretic analysis of RED , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Sally Floyd,et al.  Adaptive RED: An Algorithm for Increasing the Robustness of RED's Active Queue Management , 2001 .

[7]  Craig Partridge,et al.  Packet reordering is not pathological network behavior , 1999, TNET.

[8]  Victor Firoiu,et al.  A study of active queue management for congestion control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Donald F. Towsley,et al.  Modeling TCP Reno performance: a simple model and its empirical validation , 2000, TNET.

[10]  W. Richard Stevens,et al.  TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms , 1997, RFC.

[11]  Christophe Diot,et al.  Packet Reordering Inside the Sprint Backbone , 2001 .