Simulation of a Jackson tandem network using state-dependent importance sampling
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Importance sampling for Jackson networks
Queueing Systems: Theory and Applications
Efficient calculation of rare event probabilities in Markovian queueing networks
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
On Lyapunov Inequalities and Subsolutions for Efficient Importance Sampling
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Rare event simulation techniques
Proceedings of the Winter Simulation Conference
Efficient importance sampling schemes for a feed-forward network
ACM Transactions on Modeling and Computer Simulation (TOMACS)
New efficient estimators in rare event simulation with heavy tails
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
We consider a variant of the two-node tandem Jackson network where the upstream server reduces its service rate when the downstream queue exceeds some prespecified threshold. The rare event of interest is the overflow of the downstream queue. Based on a game/subsolution approach, we rigorously identify the exponential decay rate of the rare event probabilities and construct asymptotically optimal importance sampling schemes.