System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ramesh, S. ; Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA ; Rouskas, G.N. ; Perros, H.G.

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

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:20 ,  Issue: 1 )