On customer flows in jackson queueing networks

Abstract

Melamed's theorem states that, for a Jackson queueing network, the equilibrium flow along a link follows a Poisson distribution if and only if no customers can travel along the link more than once. Barbour and 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 note, we prove that the customer flow process is a Poisson cluster process and then establish a general approximate version of Melamed's theorem that accommodates all possible cases of 0 ≤ p < 1. © Applied Probability Trust 2010.