A Light-Traffic Theorem for Multi-Server Queues

DOI10.1287/moor.8.1.15zbMath0507.90031OpenAlexW2070951060MaRDI QIDQ4745584

David Burman, Donald R. Smith

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1287/moor.8.1.15

zbMATH Keywords

insensitivityphase-type serviceapproximation for the expected delaycomputatinal approachequilibrium-excess service-timeslight-traffic resultM/G/c queue

Mathematics Subject Classification ID

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

Related Items (9)

Approximations for multi-server queues: System interpolations ⋮ Analyticity of single-server queues in light traffic ⋮ On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough ⋮ Approximations for the delay probability in the \(M/G/s\) queue ⋮ Comparison conjectures about the M/G/s queue ⋮ On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems ⋮ Labour costs and queueing theory in retailing ⋮ Approximations for the conditional waiting times in the GI/G/c queue ⋮ Bounds for the mean queue length of the \(M/K_ 2/m\) queue

This page was built for publication: A Light-Traffic Theorem for Multi-Server Queues