Analysis of an importance sampling estimator for tandem queues
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Fast simulation of rare events in queueing and reliability models
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Cross-entropy and rare events for maximal cut and partition problems
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue: Rare event simulation
Efficient simulation of a tandem Jackson network
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Efficient simulation of buffer overflow probabilities in jackson networks with feedback
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Importance Sampling Simulation of Population Overflow in Two-node Tandem Networks
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
WSC '05 Proceedings of the 37th conference on Winter simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Hi-index | 0.00 |
In this paper we propose a state-dependent importance sampling heuristic to estimate the probability of population overflow in networks of parallel queues. This heuristic approximates the "optimal" state-dependent change of measure without the need for difficult mathematical analysis or costly optimization involved in adaptive methodologies. Comprehensive simulations of networks with an arbitrary number of parallel queues and different traffic intensities yield asymptotically efficient estimates (with relative error increasing sub-linearly in the overflow level) where no other state-independent importance sampling techniques are known to be efficient. The efficiency of the proposed heuristic surpasses those based on adaptive importance sampling algorithms, yet it is easier to determine and implement and scales better for large networks.