Probability
Fast simulation of rare events in queueing and reliability models
ACM Transactions on Modeling and Computer Simulation (TOMACS)
An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates
IEEE/ACM Transactions on Networking (TON)
Fast simulation of packet loss rates in a shared buffer communications switch
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Product form equilibrium distributions and a convolution algorithm for stochastic Petri nets
Performance Evaluation
Wide-Sense Nonblocking Clos Networks Under Packing Strategy
IEEE Transactions on Computers
Fast simulation of networks of queues with effective and decoupling bandwidths
ACM Transactions on Modeling and Computer Simulation (TOMACS)
IEEE Transactions on Parallel and Distributed Systems
Estimation of blocking probabilities in cellular networks with dynamic channel assignment
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue: Rare event simulation
Simulation of rare events in communications networks
IEEE Communications Magazine
An adaptive approach to fast simulation of traffic groomed optical networks
WSC '04 Proceedings of the 36th conference on Winter simulation
An adaptive approach to accelerated evaluation of highly available services
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Fast simulation of service availability in mesh networks with dynamic path restoration
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
This paper considers the estimation of blocking probabilities of circuit-switched WDM networks with no wavelength converters and with fixed routing. It presents an importance sampling simulation technique for determining whether or not such a network meets a specific grade of service requirement, in the sense of all routes having blocking below a given threshold. It is especially efficient for networks with high grades of service, which take a long time to simulate using conventional methods.