A Light Traffic Approximation for a Single-Server Queue

DOI10.1287/MOOR.9.4.624MaRDI QIDQ3341639zbMATH OpenOpenAlexFDO

Authors Tomasz Rolski, D. 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

light traffic approximationstationary waiting time

Mathematics Subject Classification ID

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

Recommendations

• Light traffic equivalence in single-server queues
• Light Traffic Approximations in Queues
• Light traffic approximations in general stationary single-server queues
• Exponential approximation of waiting time and queue size for queues in heavy traffic
• Queues in series in light traffic

Cited in

(12)

• Light traffic equivalence in single-server queues
• Light traffic for workload in queues
• The \(M/G/c\) queue in light traffic
• Light traffic approximations in general stationary single-server queues
• The advantage of indices of dispersion in queueing approximations
• Heavy-traffic asymptotics for the single-server queue with random order of service
• Light Traffic Approximations in Queues
• Light traffic approximations in many-server queues
• Idle period approximations and bounds for the GI/G/1 queue
• On the accuracy of phase-type approximations of heavy-tailed risk models
• Heavy-traffic single-server queues and the transform method
• Light traffic heuristic for an M/G/1 queue with limited inventory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3341639)