Skip to Main content Skip to Navigation

Bounds for the Coupling Time in Queueing Networks Perfect Simulation

Jantien Dopper 1 Bruno Gaujal 2 Jean-Marc Vincent 2
2 MESCAL - Middleware efficiently scalable
ID-IMAG - Informatique et Distribution, Inria Grenoble - Rhône-Alpes
Abstract : In this paper, the duration of perfect simulations for Markovian finite capacity queuing networks is studied. This corresponds to hitting time (or coupling time) problems in a Markov chain over the Cartesian product of the state space of each queue. We establish an analytical formula for the expected simulation time in the one queue case and we provide simple bounds for acyclic networks of queues with losses. These bounds correspond to sums on the coupling time for each queue and are either almost linear in the queue capacities under light or heavy traffic assumptions or quadratic, when service and arrival rates are similar.
Document type :
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 7:27:53 PM
Last modification on : Thursday, December 9, 2021 - 3:08:05 PM
Long-term archiving on: : Sunday, April 4, 2010 - 8:31:16 PM


  • HAL Id : inria-00070197, version 1



Jantien Dopper, Bruno Gaujal, Jean-Marc Vincent. Bounds for the Coupling Time in Queueing Networks Perfect Simulation. [Research Report] RR-5828, INRIA. 2006, pp.25. ⟨inria-00070197⟩



Les métriques sont temporairement indisponibles