Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload

DOI10.1287/opre.44.5.758zbMath0879.60102OpenAlexW2093773493MaRDI QIDQ4345595

Joseph Abate, Ward Whitt, Gagan L. Choudhury

Publication date: 28 January 1998

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2220c0a89f8d4b10ce74a2de19e0c6e6674099ae

zbMATH Keywords

numerical examplessteady-state waiting timebatch Markovian arrival processessteady-state tail probabilities in queues

Mathematics Subject Classification ID

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

Related Items (9)

A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues ⋮ Effective bandwidths for Markov regenerative sources ⋮ A comparison of the sliding window and the leaky bucket ⋮ Quandary of service logistics: fast or reliable? ⋮ A Stochastic Queueing Model for Capacity Allocation in the Hierarchical Healthcare Delivery System ⋮ Characterisation of the output process of a discrete-time \(GI/D/1\) queue, and its application to network performance ⋮ Ergodic theorems for queuing systems with dependent inter-arrival times ⋮ Price, delivery time guarantees and capacity selection ⋮ Sampling at subexponential times, with queueing applications

This page was built for publication: Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload