Analysis on packet resequencing for reliable network protocols

Packets are sometimes disordered in the network. Reliable protocols such as TCP require packets to be accepted, i.e., delivered to the receiving application, in the order they are transmitted at the sender. In order to do so, the receiver's transport layer must resequence the packets with the help of a resequencing buffer. Even if the application can consume the packets infinitely fast, the packets may still be delayed for resequencing. In this paper, we model packet disordering by adding an independently and identically distributed (IID) random propagation delay to each packet and analyze the required buffer size for packet resequencing and the resequencing delay for an average packet. We demonstrate that these two quantities can be significant and show how they scale with the network bandwidth.

[1]  Alain Jean-Marie,et al.  Parallel queues with resequencing , 1993, JACM.

[2]  Shyamal Chowdhury.  An analysis of virtual circuits with parallel links , 1991, IEEE Trans. Commun..

[3]  Moshe Sidi,et al.  Selective-repeat ARQ: the joint distribution of the transmitter and the receiver resequencing buffer occupancies , 1990, IEEE Trans. Commun..

[4]  S. Varma.  Optimal allocation of customers in a two server queue with resequencing , 1988 .

[5]  Nachum Shacham,et al.  A selective-repeat-ARQ protocol for parallel channels and its resequencing analysis , 1992, IEEE Trans. Commun..

[6]  Donald F. Towsley,et al.  Resequencing delay and buffer occupancy in selective repeat ARQ with multiple receivers , 1991, IEEE Trans. Commun..

[7]  Shivendra S. Panwar,et al.  On a resequencing model for high speed networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[8]  Ilias Iliadis,et al.  Resequencing delay for a queueing system with two heterogeneous servers under a threshold-type scheduling , 1988, IEEE Trans. Commun..

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

[10]  Shu Lin,et al.  The Analysis of Some Selective-Repeat ARQ Schemes with Finite Receiver Buffer , 1981, IEEE Trans. Commun..

[11]  Tak-Shing Peter Yum,et al.  Resequencing of messages in communication networks , 1986, IEEE Trans. Commun..

[12]  R. F. Brown,et al.  PERFORMANCE EVALUATION , 2019, ISO 22301:2019 and business continuity management – Understand how to plan, implement and enhance a business continuity management system (BCMS).

[13]  Erol Gelenbe,et al.  An End-to-End Approach to the Resequencing Problem , 1984, JACM.

[14]  Brigitte Plateau,et al.  Queueing Analysis of a Reordering Issue , 1982, IEEE Transactions on Software Engineering.

[15]  Miltiades E. Anagnostou,et al.  Performance Analysis of the Selective Repeat ARQ Protocol , 1986, IEEE Trans. Commun..

[16]  Don Towsley,et al.  On the Statistical Analysis of Queue Lengths and Waiting Times for Statistical Multiplexers with ARQ Retransmission Schemes , 1979, IEEE Trans. Commun..

[17]  Alan G. Konheim,et al.  A Queueing Analysis of Two ARQ Protocols , 1980, IEEE Trans. Commun..

[18]  Zvi Rosberg,et al.  Optimal routing to two parallel heterogeneous servers with resequencing , 1991 .

[19]  R. Durrett.  Probability: Theory and Examples , 1993 .

[20]  Armand M. Makowski,et al.  Queueing models for systems with synchronization constraints , 1989, Proc. IEEE.

[21]  Zvi Rosberg,et al.  Resequencing delay and buffer occupancy under the selective-repeat ARQ , 1989, IEEE Trans. Inf. Theory.

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

[23]  Don Towsley,et al.  The Stutter Go Back-N ARQ Protocol , 1979, IEEE Trans. Commun..

[24]  I. Rubin,et al.  An Analysis of a TDMA Channel Using Stop-and-Wait, Block, and Select-and-Repeat ARQ Error Control , 1982, IEEE Trans. Commun..