Importance sampling for stochastic simulations
Management Science
Quick simulation of ATM buffers with on-off multiclass Markov fluid sources
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Effective bandwidth and fast simulation of ATM intree networks
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Correctness within a constant of an optimal buffer allocation rule of thumb
IEEE Transactions on Information Theory
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 32nd conference on Winter simulation
Efficient simulation of a tandem Jackson network
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Implementation of Importance Splitting Techniques in Stochastic Petri Net Package
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Combining importance sampling and temporal difference control variates to simulate Markov Chains
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Proceedings of the 35th conference on Winter simulation: driving innovation
Efficient simulation of buffer overflow probabilities in jackson networks with feedback
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Analysis of state-independent importance-sampling measures for the two-node tandem queue
ACM Transactions on Modeling and Computer Simulation (TOMACS)
WSC '05 Proceedings of the 37th conference on Winter simulation
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
Efficient simulation of population overflow in parallel queues
Proceedings of the 38th conference on Winter simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Tandem queue with server slow-down
ACM SIGMETRICS Performance Evaluation Review
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
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
Asymptotically optimal importance sampling for Jackson networks with a tree topology
Queueing Systems: Theory and Applications
State-dependent importance sampling for a Jackson tandem network
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A variant of importance splitting for rare event estimation: Fixed number of successes
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Efficient calculation of rare event probabilities in Markovian queueing networks
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Asymptotics of overflow probabilities in Jackson networks
Operations Research Letters
On Lyapunov Inequalities and Subsolutions for Efficient Importance Sampling
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Efficient importance sampling under partial information
Proceedings of the Winter Simulation Conference
Rare event simulation techniques
Proceedings of the Winter Simulation Conference
Importance sampling for stochastic recurrence equations with heavy tailed increments
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
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.