By Topic

An Analytic Approach to Efficiently Computing Call Blocking Probabilities for Multiclass WDM Networks

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

2 Author(s)
Kuppuswamy, K. ; Qualcomm Inc., San Diego, CA ; Lee, D.C.

For all-optical WDM networks that provide multiple classes of service, we present a methodology for computing approximate blocking probabilities of dynamic routing and wavelength assignment policies. Each service class is characterized by its resource requirements (number of wavelengths needed for a call) and expected call holding time (or subscription period). Under the wavelength continuity constraint on lightpaths and loss network formulation, we develop fixed-point approximation algorithms that compute approximate blocking probabilities of all classes. We then apply them to the random wavelength assignment policy for the following wavelength routing policies: fixed routing (FR), least loaded routing (LLR) and fixed alternate routing (FAR). Simulation results on different network topologies and routing policies considered demonstrate that the simulation results match closely with the blocking probabilities computed by our methods for different multiclass call traffic loading scenarios.

Published in:

Networking, IEEE/ACM Transactions on  (Volume:17 ,  Issue: 2 )