### Abstract

The two-node tandem Jackson network serves as a convenient reference model for the analysis and testing of different methodologies and techniques in rare event simulation. In this paper we consider a new approach to efficiently estimate the probability that the content of the second buffer exceeds some high level L before it becomes empty, starting from a given state. The approach is based on a Markov additive process representation of the buffer processes, leading to an exponential change of measure to be used in an importance sampling procedure. Unlike changes of measures proposed and studied in recent literature, the one derived here is a function of the content of the first buffer. We prove that when the first buffer is finite, this method yields asymptotically efficient simulation for any set of arrival and service rates. In fact, the relative error is bounded independent of the level L; a new result which is not established for any other known method. When the first buffer is infinite, we propose a natural extension of the exponential change of measure for the finite buffer case. In this case, the relative error is shown to be bounded (independent of L) only when the second server is the bottleneck; a result which is known to hold for some other methods derived through large deviations analysis. When the first server is the bottleneck, experimental results using our method seem to suggest that the relative error is bounded linearly in L.

Original language | English |
---|---|

Pages (from-to) | 119-141 |

Number of pages | 23 |

Journal | ACM transactions on modeling and computer simulation |

Volume | 12 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2002 |

### Keywords

- Algorithms
- Experimentation
- Performance
- Theory
- Bounded relative error
- Importance sampling
- Markov additive processes
- Orthogonal polynomials
- Rare event simulation
- Tandem Jackson network

## Fingerprint Dive into the research topics of 'Efficient simulation of a tandem Jackson network'. Together they form a unique fingerprint.

## Cite this

Kroese, D. P., & Nicola, V. F. (2002). Efficient simulation of a tandem Jackson network.

*ACM transactions on modeling and computer simulation*,*12*(2), 119-141. https://doi.org/10.1145/566392.566395