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

Dept. of Electr. & Electron. Eng., Hong Kong Univ.;
IEEE Transactions on Parallel and Distributed Systems (Impact Factor: 1.8). 05/2007; 18(4):522-535. DOI: 10.1109/TPDS.2007.1011
Source: DBLP

ABSTRACT Transmission control protocol (TCP) is the most popular transport layer protocol for the Internet. Due to various reasons, such as multipath routing, route fluttering, and retransmissions, packets belonging to the same flow may arrive out of order at a destination. Such packet reordering violates the design principles of some traffic control mechanisms in TCP and, thus, poses performance problems. In this paper, we provide a comprehensive and in-depth survey on recent research on packet reordering in TCP. The causes and problems for packet reordering are discussed. Various representative algorithms are examined and compared by computer simulations. The ported program codes and simulation scripts are available for download. Some open questions are discussed to stimulate further research in this area

1 Bookmark
  • [Show abstract] [Hide abstract]
    ABSTRACT: The congestion control mechanisms in the standardized Transmission Control Protocol (TCP) may misinterpret packet reordering as congestive loss, leading to spurious congestion response and under-utilization of network capacity. Therefore, many TCP enhancements have been proposed to better differentiate between packet reordering and congestive loss, in order to enhance the reordering robustness (RR) of TCP. Since such enhancements are incrementally deployed, it is important to study the interactions of TCP flows with heterogeneous RR. This paper presents the first systematic study of such interactions by exploring how changing RR of TCP flows influences the bandwidth sharing among these flows. We define the quantified RR (QRR) of a TCP flow as the probability that packet reordering causes congestion response. We analyze the variation of bandwidth sharing as QRR changes. This leads to the discovery of several interesting properties. Most notably, we discover the counter-intuitive result that changing one flow's QRR does not affect its competing flows in certain network topologies. We further characterize the deviation, from the ideal case of bandwidth sharing, as RR changes. We find that enhancing RR of a flow may increase, rather than decrease, the deviation in some typical network scenarios.
    INFOCOM, 2013 Proceedings IEEE; 01/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: The wireless medium may cause substantial packet losses, rendering Transmission Control Protocol (TCP) inefficient. We propose a cross-layer solution by combining link-layer retransmission techniques and a solution for TCP packet reordering. It is costly to conduct link-layer retransmission with the constraint of orderly packet delivery. We require the link layer to provide reliable packet delivery, but without orderly delivery guarantee, thus transforming the problem of high packet error rates to the problem of packet reordering. The latter is dealt with by enhancing TCP with a solution for packet reordering. We justify our design by analyzing both general scenarios and the case of IEEE 802.11n. Our simulation results demonstrate that the proposed method is effective in improving TCP connection goodput in wireless networks.
    Wireless Networks 01/2013; · 0.74 Impact Factor
  • Source
    Access Networks - 5th International ICST Conference on Access Networks, AccessNets 2010 and First ICST International Workshop on Autonomic Networking and Self-Management in Access Networks, SELFMAGICNETS 2010, Budapest, Hungary, November 3-5, 2010, Revised Selected Papers; 01/2010


Available from