Perfect sampling of Jackson queueing networks

Ana Bušic 1, 2, 3 Stéphane Durand 4 Bruno Gaujal 5 Florence Perronnin 4
1 DYOGENE - Dynamics of Geometric Networks
CNRS - Centre National de la Recherche Scientifique : UMR8548, Inria Paris-Rocquencourt, DI-ENS - Département d'informatique de l'École normale supérieure
5 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-01236542
Contributor : Bruno Gaujal <>
Submitted on : Tuesday, December 1, 2015 - 8:10:04 PM
Last modification on : Wednesday, May 15, 2019 - 3:35:42 AM

Links full text

Identifiers

Citation

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

Share

Metrics

Record views

455