A Light Traffic Approximation for a Single-Server Queue

DOI10.1287/moor.9.4.624zbMath0549.60089OpenAlexW1990974689MaRDI QIDQ3341639

Tomasz Rolski, Daryl J. Daley

Publication date: 1984

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

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

zbMATH Keywords

stationary waiting timelight traffic approximation

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Queueing theory (aspects of probability theory) (60K25)

Related Items (5)

On the accuracy of phase-type approximations of heavy-tailed risk models ⋮ Light traffic for workload in queues ⋮ The advantage of indices of dispersion in queueing approximations ⋮ Idle period approximations and bounds for the GI/G/1 queue ⋮ Light traffic approximations in general stationary single-server queues

This page was built for publication: A Light Traffic Approximation for a Single-Server Queue