Tails for (max, plus) recursions under subexponentiality
From MaRDI portal
Publication:2505101
DOI10.1007/s11134-006-7730-5zbMath1130.90015OpenAlexW2107664836MaRDI QIDQ2505101
Publication date: 29 September 2006
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-006-7730-5
subexponential distributionopen queueing networkstochastic event graphresequencing delay(max, plus) recursion
Queues and service in operations research (90B22) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items (5)
Asymptotic behavior of generalized processor sharing queues under subexponential assumptions ⋮ Tandem queues with subexponential service times and finite buffers ⋮ A General Class of Closed Fork and Join Queues with Subexponential Service Times ⋮ Packet reordering in networks with heavy-tailed delays ⋮ Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic
Cites Work
- Unnamed Item
- Asymptotics of subexponential max plus networks: the stochastic event graph case
- Reduced load equivalence under subexponentiality
- Asymptotic behaviour of Wiener-Hopf factors of a random walk
- Delay moments for FIFO GI/GI/\(s\) queues
- Asymptotic behaviour of the tandem queueing system with identical service times at both queues
- Sampling at subexponential times, with queueing applications
- Large deviations of products of random topical operators.
- Moments and tails in monotone-separable stochastic networks.
- On a reduced load equivalence for fluid queues under subexponentiality
- Asymptotics of stochastic networks with subexponential service times
- Steady-state asymptotics for tandem, split-match and other feedforward queues with heavy tailed service
- Packet reordering in networks with heavy-tailed delays
- Reduced-load equivalence for queues with Gaussian input
- An End-to-End Approach to the Resequencing Problem
- On the tails of waiting-time distributions
- Parallel queues with resequencing
- Cyclic queueing networks with subexponential service times
- Tail probabilities for non-standard risk and queueing processes with subexponential jumps
- On the saturation rule for the stability of queues
- Fluid limit of generalized Jackson queueing networks with stationary and ergodic arrivals and service times
- Tails in generalized Jackson networks with subexponential service-time distributions
This page was built for publication: Tails for (max, plus) recursions under subexponentiality