Abstract
We investigate the simulation of overflow of the total population of a Markovian two-node tandem queue model during a busy cycle, using importance sampling with a state-independent change of measure. We show that the only such change of measure that may possibly result in asymptotically efficient simulation for large overflow levels is exchanging the arrival rate with the smallest service rate. For this change of measure, we classify the model's parameter space into regions of asymptotic efficiency, exponential growth of the relative error, and infinite variance, using both analytical and numerical techniques.
Original language | English |
---|---|
Pages (from-to) | 225-250 |
Number of pages | 26 |
Journal | ACM transactions on modeling and computer simulation |
Volume | 16 |
Issue number | 2/3 |
DOIs | |
Publication status | Published - Jul 2006 |
Keywords
- 2025 OA procedure