Packet reordering in networks with heavy-tailed delays

DOI10.1007/S00186-007-0175-8zbMATH Open1146.90375OpenAlexW2123719348MaRDI QIDQ2483015FDOQ2483015

Authors: Marc Lelarge 

Publication date: 5 May 2008

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-007-0175-8

Recommendations

• On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case
• On the influence of resequencing on the regularity of service
• An End-to-End Approach to the Resequencing Problem
• Counting preimages of TCP reordering patterns
• Combinatorics of TCP reordering

zbMATH Keywords

AsymptoticsParallel queuesResequencingHeavy tail

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sampling at subexponential times, with queueing applications
• Moments and tails in monotone-separable stochastic networks.
• A relation between stationary queue and waiting time distributions
• Tail asymptotics for discrete event systems
• Tails for (max, plus) recursions under subexponentiality
• Asymptotics of subexponential max plus networks: the stochastic event graph case
• Sampling at a random time with a heavy-tailed distribution
• Tail Asymptotics for Monotone-Separable Networks
• Parallel queues with resequencing
• Title not available (Why is that?)

Cited In (16)

• Tail asymptotics for discrete event systems
• On the influence of resequencing on the regularity of service
• Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks
• Combinatorics of TCP reordering
• On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case
• Counting preimages of TCP reordering patterns
• Tail asymptotic behaviour of resequencing buffer content for selective repeat ARQ
• An End-to-End Approach to the Resequencing Problem
• The Switch Reordering Contagion: Preventing a Few Late Packets from Ruining the Whole Party
• Sorting reordered packets with interrupt coalescing
• Tandem queues with subexponential service times and finite buffers
• Two-channel \(\mathrm{MAP}/\mathrm{PH}/2\) system with customer resequencing
• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
• Tails for (max, plus) recursions under subexponentiality
• Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
• Packet delay caused by stack-algorithm for overcritical income flow

This page was built for publication: Packet reordering in networks with heavy-tailed delays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483015)