On the efficiency of perfect simulation in monotone queueing networks

Jonatha Anselmi 1 Bruno Gaujal 2
2 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : We consider Jackson queueing networks (JQN) with finite capacity constraints and analyze the temporal computational complexity of sampling from their stationary distribution. In the context of perfect sampling, the monotonicity of JQNs ensures that it is the coupling time of extremal sample-paths. In the context of approximate sampling, it is given by the mixing time. We give a sufficient condition to prove that the coupling time of JQNs with M queues is O(M ∑Mi=1 Ci), where Ci denotes the capacity (buffer size) of queue i. This condition lets us deal with networks having arbitrary topology, for which the best bound known is exponential in the Ci's or in M. Then, we use this result to show that the mixing time of JQNs is log2 1/∈ O(M ∑Mi=1 Ci), where ∈ is a precision threshold. The main idea of our proof relies on a recursive formula on the coupling times of special sample-paths and provides a methodology for analyzing the coupling and mixing times of several monotone Markovian networks.
Liste complète des métadonnées

https://hal.inria.fr/hal-00788800
Contributor : Arnaud Legrand <>
Submitted on : Friday, February 15, 2013 - 11:16:44 AM
Last modification on : Thursday, October 11, 2018 - 8:48:02 AM

Identifiers

Collections

Citation

Jonatha Anselmi, Bruno Gaujal. On the efficiency of perfect simulation in monotone queueing networks. IFIP Performance: 29th International Symposium on Computer Performance, Modeling, Measurements and Evaluation, 2011, Amsterdam, Netherlands. pp.56-58, ⟨10.1145/2034832.2034847⟩. ⟨hal-00788800⟩

Share

Metrics

Record views

196