Fast Simulation of the Customer Blocking Probability in Queueing Networks with Multicast Access

A model of a queueing network with several input Poisson flows is considered. These flows require connections between given terminals. The connection path depends on the type of the customer, the requested resource, the paths currently occupied, and on the overall load on communication channels of the network. A fast simulation method for evaluation of blocking probability for customers of a certain flow with a required resource not lower than the given one is proposed.