IEEE/ACM Transactions on Networking (TON)
Restart: a straightforward method for fast simulation of rare events
WSC '94 Proceedings of the 26th conference on Winter simulation
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)
Efficient simulation of a tandem Jackson network
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Efficient heuristics for the simulation of population overflow in series and parallel queues
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Simulation of a Jackson tandem network using state-dependent importance sampling
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Rare-Event Simulation for Tandem Queues: A Simple and Efficient Importance Sampling Scheme
NET-COOP '09 Proceedings of the 3rd Euro-NF Conference on Network Control and Optimization
State-dependent importance sampling for a Jackson tandem network
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Cross-entropy optimisation of importance sampling parameters for statistical model checking
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Reinsch's smoothing spline simulation metamodels
Proceedings of the Winter Simulation Conference
Hi-index | 0.00 |
In this paper, a method is presented for the efficient estimation of rare-event (overflow) probabilities in Jackson queueing networks using importance sampling. The method differs in two ways from methods discussed in most earlier literature: the change of measure is state-dependent, i.e., it is a function of the content of the buffers, and the change of measure is determined using a cross-entropy-based adaptive procedure. This method yields asymptotically efficient estimation of overflow probabilities of queueing models for which it has been shown that methods using a state-independent change of measure are not asymptotically efficient. Numerical results demonstrating the effectiveness of the method are presented as well.