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

DOI10.1016/0167-6377(83)90027-5MaRDI QIDQ595278zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 4043000 (Why is no real title available?)
• L = λW: A Discounted Analogue and a New Proof
• Semi-stationary clearing processes
• Technical Note—A Last Word on L = λW
• The Relation between Customer and Time Averages in Queues

Cited in

(7)

• 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 central-limit-theorem version of L= W
• Rate conservation laws: A survey
• A review of L= W and extensions
• 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

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

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