Abstract
An important characteristic of any TCP connection is the sequencing of packets within that connection. Out-of sequence packets indicate that the connection suffers from loss, duplication or reordering. More generally, in many distributed applications information integrity requires that data exchanges between different nodes of a system be performed in a specific order. However, due to random delays over different paths in a system, the packets may arrive at the receiver in a different order than their chronological order. In such a case, a resequencing buffer at the receiver has to store disordered packets temporarily. We analyze both the waiting time of a packet in the resequencing buffer and the size of this resequencing queue. We derive the exact asymptotics for the large deviation of these quantities under heavy-tailed assumptions. In contrast with results obtained for light-tailed distributions, we show that there exists several “typical paths” that lead to the large deviation. We derive explicitly these different “typical paths” and give heuristic rules for an optimal balancing.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Asmussen S, Klüppelberg C, Sigman K (1999) Sampling at subexponential times, with queueing applications. Stochas Process Appl 79(2):265–286
Baccelli F, Foss S (2004) Moments and tails in monotone-separable stochastic networks. Ann Appl Probab 14(2):612–650
Baccelli F, Makowski A (1989) Queueing models for systems with synchronization constraints. Proc IEEE 77(1):138–161
Baccelli F, Cohen G, Olsder GJ, Quadrat J-P (1992) Synchronization and Linearity. Wiley. Available at http://www-ocq.inria.fr/metalau/cohen/SED/book-online.html
Baccelli F, Lelarge M, Foss S (2004) Asymptotics of subexponential max plus networks: the stochastic event graph case. Queueing Syst 46(1–2):75–96
Bennett JCR, Partridge C, Shectman N (1999) Packet reordering is not pathological network behavior. IEEE/ACM Trans Netw 7(6):789–798
Bingham NH, Goldie CM, Teugels JL (1989) Regular variation. Volume 27 of Encyclopedia of mathematics and its applications. Cambridge University Press, Cambridge
Blanton E, Allman M (2002) On making TCP more robust to packet reordering. SIGCOMM Comput Commun Rev 32(1):20–30
Crovella ME (2000) Performance evaluation with heavy tailed distributions. In: Lecture Notes in Computer Science 1786, pp 1–9
Crovella ME, Frangioso R, Harchol-Balter M (1999) Connection scheduling in Web servers. In: 1999 USENIX Symposium on Internet Technologies and Systems (USITS ’99)
Dieker AB, Lelarge M (2006) Tails for (max, plus) recursions under subexponentiality. Queueing Syst 53(4):213–230
Embrechts P, Klüppelberg C, Mikosch T (2003) Modelling extremal events for insurance and finance. Springer, Heidelberg
Foss S, Korshunov D (2000) Sampling at a random time with a heavy-tailed distribution. Markov Process. Related Fields 6(4):543–568
Haji R, Newell GF (1971) A relation between stationary queue and waiting time distributions. J Appl Prob 8:617–620
Han Y, Makowski A (2006) Resequencing delays under multipath routing - Asymptotics in a simple queueing model. In: INFOCOM
Hui P, Chaintreau A, Scott J, Gass R, Crowcroft J, Diot C (2005) Pocket switched networks and human mobility in conference environments. In: WDTN ’05: Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking. ACM Press, New York, pp 244–251
Iyer S, McKeown NW (2003) Analysis of the parallel packet switch architecture. IEEE/ACM Trans Netw 11(2):314–324
Jean-Marie A, Gün L (1993) Parallel queues with resequencing. J Assoc Comput Mach 40(5):1188–1208
Keslassy I, Chang C, McKeown N, Lee D (2005) Optimal load-balancing. In Infocom 2005, Miami, Florida
Laor M, Gendel L (2002) The effect of packet reordering in a backbone link on application throughput. IEEE Network
Lelarge M (2006) Tail asymptotics for discrete event systems. In valuetools ’06: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools. ACM Press, New York, pp 36
Lelarge M (2007) Tail asymptotics for monotone-separable networks. J Appl Probab 44(2):306–320
Paxson V (1997) Automated packet trace analysis of TCP implementations. In: SIGCOMM ’97: Proceedings of the ACM SIGCOMM ’97 conference on Applications, technologies, architectures, and protocols for computer communication. ACM Press, New York, pp 167–179
Willinger W, Taqqu MS, Sherman R, Wilson DV (1997) Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level. IEEE/ACM Trans Netw 5(1):71–86
Willinger W, Paxson V, Riedi RH, Taqqu MS (2003) Long-range dependence and data network traffic. In: Theory and applications of long-range dependence. Birkhäuser Boston, Boston, pp 373–407
Xia Y, Tse DNC (2003) Analysis on packet resequencing for reliable network protocols. In INFOCOM
Xia Y, Tse D (2004) On the large deviation of resequencing queue size: 2-M/M/1 case. IEEE INFOCOM Proceedings
Zhou X, Mieghem PV (2004) Reordering of IP packets in internet. Lecture notes in computer science 3015:237–246
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lelarge, M. Packet reordering in networks with heavy-tailed delays. Math Meth Oper Res 67, 341–371 (2008). https://doi.org/10.1007/s00186-007-0175-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-007-0175-8