Computing approximate blocking probabilities for large loss networks with state-dependent routing
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
All-optical networks with sparse wavelength conversion
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
A path decomposition approach for computing blocking probabilities in wavelength-routing networks
IEEE/ACM Transactions on Networking (TON)
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks
IEEE/ACM Transactions on Networking (TON)
Performance of Alternate Routing Methods in All--Optical Switching Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Proportional QoS over WDM Networks: Blocking Probability
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Blocking in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Reduced load approximations for large-scale optical WDM networks offering multiclass services
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Management of optical networks and services
IEEE Communications Magazine
Computing approximate blocking probabilities for a class of all-optical networks
IEEE Journal on Selected Areas in Communications
Models of blocking probability in all-optical networks with and without wavelength changers
IEEE Journal on Selected Areas in Communications
Wavelength conversion in WDM networking
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Computing blocking probabilities in multiclass wavelength-routing networks with multicast calls
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications - Part Supplement
International Journal of Communication Systems
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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.