Asymptotics for steady-state tail probabilities in structured markov queueing models

DOI10.1080/15326349408807290zbMath0801.60082OpenAlexW2138685211MaRDI QIDQ4288003

Ward Whitt, Joseph Abate, Gagan L. Choudhury

Publication date: 20 November 1994

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349408807290

zbMATH Keywords

Markov chains waiting time Tauberian theorem batch Markovian arrival process queueing models steady-state distributions

Mathematics Subject Classification ID

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

Related Items (29)

On the Time Reversal of Markovian Arrival Processes ⋮ Waiting-time tail probabilities in queues with long-tail service-time distributions ⋮ Analysis of $\mathrm{BMAP}/\mathrm{MSP}/1$ queue ⋮ A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues ⋮ On the use of second‐order descriptors to predict queueing behavior of MAPs ⋮ Effective bandwidths for Markov regenerative sources ⋮ Unnamed Item ⋮ A numerically efficient method for the $MAP/D/1/K$ queue via rational approximations ⋮ Corrected Phase-Type Approximations of Heavy-Tailed Queueing Models in a Markovian Environment ⋮ Light-tailed asymptotics of $\mathrm{GI}/\mathrm{G}/1$-type Markov chains ⋮ Detailed analytical and computational studies of $D-BMAP/D-BMSP1$ queueing system ⋮ Perturbation theory for the LDU factorization and accurate computations for diagonally dominant matrices ⋮ Unnamed Item ⋮ A Rare-Event Simulation Algorithm for Periodic Single-Server Queues ⋮ Asymptotics of the Invariant Measure of a Generalized Markov Branching Process ⋮ Modelling and analysis of $GI/BMSP/1$ queueing system ⋮ TAIL PROBABILITIES IN QUEUEING PROCESSES ⋮ Accurate computation of the smallest eigenvalue of a diagonally dominant $M$-matrix ⋮ Tail asymptotics for M/G/1-type queueing processes with light-tailed increments ⋮ Subexponential asymptotics of the stationary distributions of M/G/1-type Markov chains ⋮ Analyzing discrete-time $GI^{[X}/D-MSP/1/\infty$ queueing system using $RG$-factorization] ⋮ Light-Tailed Asymptotics of Stationary Tail Probability Vectors of Markov Chains of M/G/1 Type ⋮ Maximum Values in Queueing Processes ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ Light-tailed asymptotics of stationary probability vectors of Markov chains of GI/G/1 type ⋮ Effective bandwidths and performance bounds in high-speed communication systems ⋮ An ODE for an Overloaded X Model Involving a Stochastic Averaging Principle ⋮ Sampling at subexponential times, with queueing applications ⋮ A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible $M$-matrix

This page was built for publication: Asymptotics for steady-state tail probabilities in structured markov queueing models