Survey of closed queueing networks with blocking
ACM Computing Surveys (CSUR)
Queueing networks with blocking
Queueing networks with blocking
Exact sampling with coupled Markov chains and applications to statistical mechanics
Proceedings of the seventh international conference on Random structures and algorithms
Queueing networks and Markov chains: modeling and performance evaluation with computer science applications
SIAM Review
Analysis of Queueing Networks with Blocking
Analysis of Queueing Networks with Blocking
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Perfect Simulation of Queueing Networks with Blocking and Rejection
SAINT-W '05 Proceedings of the 2005 Symposium on Applications and the Internet Workshops
Perfect simulation of index based routing queueing networks
ACM SIGMETRICS Performance Evaluation Review
Discrete Event Dynamic Systems
Perfect Simulation of Stochastic Automata Networks
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
Perfect simulation and non-monotone Markovian systems
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Steady state property verification of very large systems
International Journal of Critical Computer-Based Systems
Perfect sampling of Markov chains with piecewise homogeneous events
Performance Evaluation
Steady-state property verification: a comparison study
VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems
Perfect sampling of networks with finite and infinite capacity queues
ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications
| Hi-index | 0.00 |
This paper deals with the estimation of rare event probabilities in finite capacity queueing networks. The traditional product form property of Markovian queueing networks usually vanishes when capacity of queues are finite and clients are blocked or rejected. A new efficient simulation method, derived from Propp & Wilson (Propp 1996), perfect simulation, is applied in the finite capacity queue context. An algorithm directly samples states of the network according to the stationary distribution. This method is adapted for simulation of rare events, typically when events are described by an increasing subset of the state space.Provided that events of the network are monotone, monotonicity techniques are used to reduce the sampling time. Moreover, a stopping mechanism has been developed to interrupt the simulation when an increasing set has been reached. Then, for the estimation of a monotonous reward function, the simulation time could be reduced drastically as in (Vincent and Marchand 2004).