A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues
From MaRDI portal
Publication:1342266
DOI10.1016/0167-6377(94)90081-7zbMath0814.90029OpenAlexW2150501073MaRDI QIDQ1342266
Publication date: 11 January 1995
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(94)90081-7
asymptoticstail probabilitieswaiting-time distributionheavy-traffic asymptotic expansionstable infinite-capacity multichannel queuessuperposition of independent nonidentical renewal processes
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
SET-VALUED PERFORMANCE APPROXIMATIONS FOR THE QUEUE GIVEN PARTIAL INFORMATION ⋮ Asymptotic expansions of defective renewal equations with applications to perturbed risk models and processor sharing queues ⋮ Large deviations of sojourn times in processor sharing queues ⋮ Stochastic grey-box modeling of queueing systems: fitting birth-and-death processes to data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- Large deviations behavior of counting processes and their inverses
- An Interpolation Approximation for the Mean Workload in a GI/G/1 Queue
- The caudal characteristic curve of queues
- On cycle maxima, first passage problems and extreme value theory for queues
- On the asymptotic behaviour of the stationary distribution of markov chains of M/G/1-type
- Asymptotics for steady-state tail probabilities in structured markov queueing models
- Heavy-traffic asymptotic expansions for the asymptotic decay rates in theBMAP/G/1 queue
- Risk Theory in a Periodic Environment: The Cramér-Lundberg Approximation and Lundberg's Inequality
- Stability, queue length, and delay of deterministic and stochastic queueing networks
- Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
- Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload
- Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times
- Multiple channel queues in heavy traffic. II: sequences, networks, and batches
- Multiple channel queues in heavy traffic. I