Affiliation:
1. Columbia Univ., New York, NY
Abstract
We analyze the performance of an importance sampling estimator for a rare-event probability in tandem Jackson networks. The rare event we consider corresponds to the network population reaching
K
before returning to ø, starting from ø, with
K
large. The estimator we study is based on interchanging the arrival rate and the smallest service rate and is therefore a generalization of the asymptotically optimal estimator for an M/M/1 queue. We examine its asymptotic performance for large
K
, showing that in certain parameter regions the estimator has an asymptotic efficiency property, but that in other regions it does not. The setting we consider is perhaps the simplest case of a rare-event simulation problem in which boundaries on the state space play a significant role.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,Modeling and Simulation
Reference20 articles.
1. The optimal buffer allocation problem;AN~ AR~;IEEE Trans. Inf. Theor.,1989
2. Correctness within a constant of an optimal buffer allocation rule of thumb
3. ANANTHARAM V. HEIDELBERGER P. AND TScUCAS P. 1990. Analysis of rare events in continuous time Markov chains via time reversal and fluid approximation. IBM Res. Rep. RC16820. Yorktown Heights N.Y. ANANTHARAM V. HEIDELBERGER P. AND TScUCAS P. 1990. Analysis of rare events in continuous time Markov chains via time reversal and fluid approximation. IBM Res. Rep. RC16820. Yorktown Heights N.Y.
4. Conditioned limit theorems relating a random walk to its associate, with applications to risk reserve processes and the GI/G/1 queue;ASMUSSEN S.;Adv. Appl. Prob.,1982
Cited by
81 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献