A General Class of Closed Fork and Join Queues with Subexponential Service Times
From MaRDI portal
Publication:3548753
DOI10.1080/15326340701645918zbMath1153.60391OpenAlexW2072315029MaRDI QIDQ3548753
Publication date: 17 December 2008
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326340701645918
Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (2)
Tandem queues with subexponential service times and finite buffers ⋮ ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL
Cites Work
- Asymptotics of subexponential max plus networks: the stochastic event graph case
- Estimates for the probability of ruin with special emphasis on the possibility of large claims
- Asymptotic expansions for waiting time probabilities in an \(M/G/1\) queue with long-tailed service time
- Sampling at subexponential times, with queueing applications
- Moments and tails in monotone-separable stochastic networks.
- Tail asymptotics for M/G/1 type queueing processes with subexponential increments
- Asymptotics of stochastic networks with subexponential service times
- Steady-state asymptotics for tandem, split-match and other feedforward queues with heavy tailed service
- Appendix: A primer on heavy-tailed distributions
- Tails for (max, plus) recursions under subexponentiality
- On the tails of waiting-time distributions
- Subexponential asymptotics of a Markov-modulated random walk with queueing applications
- Response times in M/M/s fork-join networks
- Cyclic queueing networks with subexponential service times
- Tails in generalized Jackson networks with subexponential service-time distributions
- Unnamed Item
- Unnamed Item
This page was built for publication: A General Class of Closed Fork and Join Queues with Subexponential Service Times
