Packet reordering in networks with heavy-tailed delays
From MaRDI portal
Publication:2483015
DOI10.1007/s00186-007-0175-8zbMath1146.90375OpenAlexW2123719348MaRDI QIDQ2483015
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
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (7)
Asymptotic behavior of generalized processor sharing queues under subexponential assumptions ⋮ 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 ⋮ Tandem queues with subexponential service times and finite buffers ⋮ Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks ⋮ Tail asymptotics for discrete event systems ⋮ Tails for (max, plus) recursions under subexponentiality
Cites Work
- Asymptotics of subexponential max plus networks: the stochastic event graph case
- Tail asymptotics for discrete event systems
- Sampling at subexponential times, with queueing applications
- Moments and tails in monotone-separable stochastic networks.
- Tails for (max, plus) recursions under subexponentiality
- Parallel queues with resequencing
- Tail Asymptotics for Monotone-Separable Networks
- A relation between stationary queue and waiting time distributions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Packet reordering in networks with heavy-tailed delays
