On customer flows in Jackson queueing networks

DOI10.1239/AAP/1293113152MaRDI QIDQ3074496zbMATHOpenAlexFDO

Authors Sen Tan, Aihua Xia

Publication date 9 February 2011

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1006.5545

zbMATH Keywords

stochastic orderingpoint processesqueueing theoryinequalitiescentral limit theoryqueues and service

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Inequalities; stochastic orderings (60E15) Central limit and other weak theorems (60F05) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Abstract: Melamed's theorem states that for a Jackson queuing network, the equilibrium flow along a link follows Poisson distribution if and only if no customers can travel along the link more than once. Barbour & Brown~(1996) considered the Poisson approximate version of Melamed's theorem by allowing the customers a small probability $p$ of travelling along the link more than once. In this paper, we prove that the customer flow process is a Poisson cluster process and then establish a general approximate version of Melamed's theorem accommodating all possible cases of $0lep<1$.

Recommendations

• Approximate versions of Melamed's theorem
• scientific article; zbMATH DE number 4030671
• On the Jackson networks
• Some poisson approximations for departure processes in general queueing networks
• Some new results on queueing networks with batch movement

Cites work

• scientific article; zbMATH DE number 3866301 (Why is no real title available?)
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• Approximate versions of Melamed's theorem
• Characterizations of Poisson traffic streams in Jackson queueing networks
• Stein's method and birth-death processes

Cited in

(5)

• scientific article; zbMATH DE number 6533353 (Why is no real title available?)
• scientific article; zbMATH DE number 1803244 (Why is no real title available?)
• Customer-oriented finite perturbation analysis for queueing networks
• Solution of balance equations and investigation of Poisson flows in Jackson networks
• Algorithm of balance equations decomposition and investigation of Poisson flows in Jackson networks

This page was built for publication: On customer flows in Jackson queueing networks

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