Continuous versions of the queuing formulas L=lambdaW and H=lambdaG

DOI10.1016/0167-6377(83)90027-5zbMath0527.60086OpenAlexW2054396990MaRDI QIDQ595278

Tomasz Rolski, Shaler jun. Stidham

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0167-6377(83)90027-5

zbMATH Keywords

limit theorem for queuesLittle's formulaqueues with continuous inputsample-path analysis

Mathematics Subject Classification ID

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

Related Items (7)

Palm calculus for a process with a stationary random measure and its applications to fluid queues ⋮ Little laws for utility processes and waiting times in queues ⋮ A central-limit-theorem version of \(L=\lambda W\) ⋮ Conservation laws and reflection mappings with an application to multiclass mean value analysis for stochastic fluid queues ⋮ Sample-path analysis of processes with imbedded point processes ⋮ A review of \(L=\lambda W\) and extensions ⋮ Rate conservation laws: A survey

Cites Work

• Unnamed Item
• Semi-stationary clearing processes
• The Relation between Customer and Time Averages in Queues
• Technical Note—A Last Word on L = λW
• L = λW: A Discounted Analogue and a New Proof

This page was built for publication: Continuous versions of the queuing formulas L=lambdaW and H=lambdaG