Approximate/perfect samplers for closed Jackson networks

Shuji Kijima, Tomomi Matsui

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we propose two samplers for the product-form solution of basic queueing networks, closed Jackson networks with multiple servers. Our approach is sampling via Markov chain, but it is NOT a simulation of behavior of customers in queueing networks. We propose two of new ergodic Markov chains both of which have a unique stationary distribution that is the product form solution of closed Jackson networks. One of them is for approximate sampling, and we show it mixes rapidly. To our knowledge, this is the first approximate polynomial-time sampler for closed Jackson networks with multiple servers. The other is for perfect sampling based on monotone CFTP (coupling from the past) algorithm proposed by Propp and Wilson,and we show the monotonicity of the chain.

Original languageEnglish
Title of host publicationProceedings of the 2005 Winter Simulation Conference
Pages862-868
Number of pages7
DOIs
Publication statusPublished - Dec 1 2005
Externally publishedYes
Event2005 Winter Simulation Conference - Orlando, FL, United States
Duration: Dec 4 2005Dec 7 2005

Publication series

NameProceedings - Winter Simulation Conference
Volume2005
ISSN (Print)0891-7736

Other

Other2005 Winter Simulation Conference
CountryUnited States
CityOrlando, FL
Period12/4/0512/7/05

All Science Journal Classification (ASJC) codes

  • Software
  • Modelling and Simulation
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Approximate/perfect samplers for closed Jackson networks'. Together they form a unique fingerprint.

  • Cite this

    Kijima, S., & Matsui, T. (2005). Approximate/perfect samplers for closed Jackson networks. In Proceedings of the 2005 Winter Simulation Conference (pp. 862-868). [1574333] (Proceedings - Winter Simulation Conference; Vol. 2005). https://doi.org/10.1109/WSC.2005.1574333