Perfect sampling of Jackson queueing networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Queueing Systems Year : 2015

Perfect sampling of Jackson queueing networks


We consider open Jackson networks with losses with mixed finite and infinite queues and analyze the efficiency of sampling from their exact stationary distribution. We show that perfect sampling is possible, although the underlying Markov chain may have an infinite state space. The main idea is to use a Jackson network with infinite buffers (that has a product form stationary distribution) to bound the number of initial conditions to be considered in the coupling from the past scheme. We also provide bounds on the sampling time of this new perfect sampling algorithm for acyclic or hyper-stable networks. These bounds show that the new algorithm is considerably more efficient than existing perfect samplers even in the case where all queues are finite. We illustrate this efficiency through numerical experiments. We also extend our approach to variable service times and non-monotone networks such as queueing networks with negative customers.

Dates and versions

hal-01236542 , version 1 (01-12-2015)



Ana Bušić, Stéphane Durand, Bruno Gaujal, Florence Perronnin. Perfect sampling of Jackson queueing networks. Queueing Systems, 2015, 80 (3), pp.37. ⟨10.1007/s11134-015-9436-z⟩. ⟨hal-01236542⟩
190 View
0 Download



Gmail Facebook Twitter LinkedIn More