Abstract
We consider open Jackson queueing networks with mixed finite and infinite buffers and analyze the efficiency of sampling from their exact stationary distribution. We show that perfect sampling is possible, although the underlying Markov chain has a large or even 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 under hyper-stability conditions (to be defined in the paper) for each queue. 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anselmi, J., Gaujal, B.: On the efficiency of perfect simulation in monotone queueing networks. In: IFIP Performance: 29th International Symposium on Computer Performance, Modeling, Measurements and Evaluation, Amsterdam (October 2011), ACM Performance Evaluation Review
Bolch, G., Greiner, S., de Meer, H., Trivedi, K.: Queueing Networks and Markov Chains. Wiley-Interscience (2005)
Busic, A., Gaujal, B., Vincent, J.-M.: Perfect simulation and non-monotone Markovian systems. In: 3rd International Conference Valuetools 2008, Athens, Greece. ICST (October 2008)
Dopper, J., Gaujal, B., Vincent, J.-M.: Bounds for the coupling time in queueing networks perfect simulation. Celebration of the 100th Anniversary of Markov, pp. 117–136 (2006)
Gaujal, B., Gorgo, G., Vincent, J.-M.: Perfect Sampling of Phase-Type Servers Using Bounding Envelopes. In: Al-Begain, K., Balsamo, S., Fiems, D., Marin, A. (eds.) ASMTA 2011. LNCS, vol. 6751, pp. 189–203. Springer, Heidelberg (2011)
Jackson, J.R.: Job shop-like queueing systems. Management Sci. 10, 131 (1963)
Kelly, F.: Reversibility and Stochastic Networks. John Wiley & Sons Ltd (1979)
Kendall, W.S.: Notes on perfect simulation. Dept. of statistics, University of Warwick (2005)
Pin, F., Busic, A., Gaujal, B.: Perfect sampling of Markov chains with piecewise homogeneous events. Technical Report 163442, arXiv (2010)
Pin, F., Busic, A., Gaujal, B.: Acceleration of perfect sampling for skipping events. In: Valuetools, Paris (2011)
Propp, J.G., Wilson, D.B.: Exact sampling with coupled markov chains and applications to statistical mechanics. Rand. Struct. Alg. 9(1-2), 223–252 (1996)
Vincent, J.-M.: Perfect simulation of monotone systems for rare event probability estimation. In: WSC 2005: Proceedings of the 37th Conference on Winter Simulation Conference, pp. 528–537 (2005)
Walker, A.J.: An efficient method for generating discrete random variables with general distributions. ACM Trans. Math. Softw. 3, 253–256 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bušić, A., Gaujal, B., Perronnin, F. (2012). Perfect Sampling of Networks with Finite and Infinite Capacity Queues. In: Al-Begain, K., Fiems, D., Vincent, JM. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2012. Lecture Notes in Computer Science, vol 7314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30782-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-30782-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30781-2
Online ISBN: 978-3-642-30782-9
eBook Packages: Computer ScienceComputer Science (R0)