A Palm calculus approach to functional versions of Little's law

DOI10.1016/S0304-4149(97)00116-6MaRDI QIDQ1805751zbMATH OpenWikidataFDO

Authors Michael A. Zazanis

Publication date 18 November 1999

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

zbMATH Keywords

probability generating functionqueueing systemPalm distributionstationary point process

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Queues and service in operations research (90B22) Stationary stochastic processes (60G10) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• A distributional form of Little's law
• A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues
• Little laws for utility processes and waiting times in queues
• The Distributional Little's Law and Its Applications
• A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networks
• A note on a pathwise version of Little's formula
• The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue

Cites work

• scientific article; zbMATH DE number 557946 (Why is no real title available?)
• scientific article; zbMATH DE number 3796940 (Why is no real title available?)
• scientific article; zbMATH DE number 879782 (Why is no real title available?)
• A Generalization of L = λW to Moments of Queue Length and Waiting Times
• A distributional form of Little's law
• A formal approach to queueing processes in the steady state and their applications
• A relation between stationary queue and waiting time distributions
• An extremal property of the fifo discipline via an ordinal version of
• Multiclass Queueing Systems in Heavy Traffic: An Asymptotic Approach Based on Distributional and Conservation Laws

Cited in

(5)

• A Swiss Army formula of Palm calculus
• THE TIME-TO-EMPTY FOR TANDEM JACKSON NETWORKS
• A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues
• Delay in a tandem queueing model with mobile queues: an analytical approximation
• Service with a queue and a random capacity cart: random processing batches and E-limited policies

This page was built for publication: A Palm calculus approach to functional versions of Little's law

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