Computing blocking probabilities in multiclass wavelength-routing networks with multicast calls

We present an approximate analytical method to compute efficiently the call-blocking probabilities in wavelength-routing networks with multiple classes of both unicast and multicast calls. Our approach involves the following steps. We start with an approximate solution to a linear single-class unicast network which we developed earlier. Next, all classes of calls on a particular route are aggregated to give an equivalent single-class model. We then extend the path decomposition algorithms that we have developed for single-class networks to handle mesh networks with multiple classes of calls. We show how to use these path decomposition algorithms to decompose large networks with multicast paths into smaller subsystems with only linear paths, which, in turn, are solved by the product-form approximation algorithm. We also consider a state-dependent Poisson arrival process for multicast calls which is more accurate in capturing the behavior of these calls.