An Analytic Approach to Efficiently Computing Call Blocking Probabilities for Multiclass WDM Networks
Kalyan Kuppuswamy, Daniel C. Lee · IEEE/ACM Transactions on Networking · 2009
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 thewavelengthcontinuityconstrainton 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.
Cited by 42 works. doi:10.1109/tnet.2008.2001465
Authors
References
- Simulation Modeling and Analysis.
- Optical Networks: A Practical Perspective
- Generalized Multi-Protocol Label Switching (GMPLS) Architecture
- Blocking in a Shared Resource Environment
- A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks
- Routing and wavelength assignment in all-optical networks
- Loss Networks
- Models of blocking probability in all-optical networks with and without wavelength changers
- Multiservice Loss Models for Broadband Telecommunication Networks
- All-Optical Network Consortium-ultrafast TDM networks