Little's law when the average waiting time is infinite

DOI10.1007/s11134-013-9364-8zbMath1310.60031OpenAlexW2164732770MaRDI QIDQ471425

Yi-Ching Yao, Ronald W. Wolff

Publication date: 14 November 2014

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-013-9364-8

zbMATH Keywords

stabilitytruncationLittle's lawdeparture rateFIFO conditionsample path

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Sample path properties (60G17) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stable stochastic processes (60G52)

Related Items (3)

A stochastic model and social optimization of a blockchain system based on a general limited batch service queue ⋮ Periodic Little’s Law ⋮ Queues with path-dependent arrival processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A review of \(L=\lambda W\) and extensions
• Little laws for utility processes and waiting times in queues
• OR FORUM—Little's Law as Viewed on Its 50th Anniversary
• A Proof for the Queuing Formula: L = λW
• Technical Note—A Last Word on L = λW
• On the relation between customer and time averages in queues

This page was built for publication: Little's law when the average waiting time is infinite