Burst lost probabilities in a queuing network with simultaneous resource possession: a single-node decomposition approach

An efficient analytical method is presented for the calculation of blocking probabilities in a tandem queuing network with simultaneous resource possession. This queuing network model is motivated from the need to model optical burst switching networks, where the size of the data bursts varies and the link distance between two adjacent network elements also varies depending on the network's topology. A fast single-node decomposition algorithm is developed to compute the blocking probabilities in the network. The algorithm extends the popular link-decomposition method from teletraffic theory by allowing dynamic simultaneous link possession. Simulation is used to validate the accuracy of the algorithm.