Advances in Applied Probability
- Adv. in Appl. Probab.
- Volume 43, Number 2 (2011), 484-503.
Exact Monte Carlo simulation for fork-join networks
In a fork-join network each incoming job is split into K tasks and the K tasks are simultaneously assigned to $K$ parallel service stations for processing. For the distributions of response times and queue lengths of fork-join networks, no explicit formulae are available. Existing methods provide only analytic approximations for the response time and the queue length distributions. The accuracy of such approximations may be difficult to justify for some complicated fork-join networks. In this paper we propose a perfect simulation method based on coupling from the past to generate exact realisations from the equilibrium of fork-join networks. Using the simulated realisations, Monte Carlo estimates for the distributions of response times and queue lengths of fork-join networks are obtained. Comparisons of Monte Carlo estimates and theoretical approximations are also provided. The efficiency of the sampling algorithm is shown theoretically and via simulation.
Adv. in Appl. Probab., Volume 43, Number 2 (2011), 484-503.
First available in Project Euclid: 21 June 2011
Permanent link to this document
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 65C05: Monte Carlo methods 65C50: Other computational problems in probability
Secondary: 60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.) [See also 90Bxx] 60K25: Queueing theory [See also 68M20, 90B22]
Dai, Hongsheng. Exact Monte Carlo simulation for fork-join networks. Adv. in Appl. Probab. 43 (2011), no. 2, 484--503. https://projecteuclid.org/euclid.aap/1308662489