Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload
DOI10.1287/OPRE.44.5.758zbMATH Open0879.60102OpenAlexW2093773493MaRDI QIDQ4345595FDOQ4345595
Authors: Joseph Abate, Gagan L. Choudhury, Ward Whitt 
Publication date: 28 January 1998
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2220c0a89f8d4b10ce74a2de19e0c6e6674099ae
Recommendations
numerical examplessteady-state waiting timebatch Markovian arrival processessteady-state tail probabilities in queues
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (12)
- Title not available (Why is that?)
- A stochastic queueing model for capacity allocation in the hierarchical healthcare delivery system
- Sampling at subexponential times, with queueing applications
- Characterisation of the output process of a discrete-time \(GI/D/1\) queue, and its application to network performance
- A comparison of the sliding window and the leaky bucket
- Estimation of the Poisson stream intensity in a multilinear queue with an exponential job queue decay
- A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues
- Price, delivery time guarantees and capacity selection
- Ergodic theorems for queuing systems with dependent inter-arrival times
- ApproximatingM/G/1 Waiting Time Tail Probabilities
- Effective bandwidths for Markov regenerative sources
- Quandary of service logistics: fast or reliable?
This page was built for publication: Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345595)
