An End-to-End Approach to the Resequencing Problem
Journal of the ACM (JACM)
Parallel queues with resequencing
Journal of the ACM (JACM)
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Queueing Analysis of a Reordering Issue
IEEE Transactions on Software Engineering
Resequencing delay and buffer occupancy under the selective-repeat ARQ
IEEE Transactions on Information Theory
Modeling and performance evaluation of transport protocols for firewall control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 4th International Conference on Queueing Theory and Network Applications
A resequencing model for high-speed packet-switching networks
Computer Communications
Selective fusion of out-of-sequence measurements
Information Fusion
Hi-index | 0.00 |
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.