All-optical networks with sparse wavelength conversion
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Adaptive wavelength routing in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Routing and Dimensioning in Circuit-Switched Networks
Routing and Dimensioning in Circuit-Switched Networks
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
A Performance Model for Wavelength Conversion with Non-Poisson Traffic
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Computing Blocking Probabilities in Multi-Class Wavelength Routing Networks
Computing Blocking Probabilities in Multi-Class Wavelength Routing Networks
Bounds on the Blocking Performance of Allocation Policies in Wavelength Routi
Bounds on the Blocking Performance of Allocation Policies in Wavelength Routi
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
Benefits of wavelength translation in all-optical clear-channel networks
IEEE Journal on Selected Areas in Communications
Guest Editorial High-Capacity Optical Transport Networks
IEEE Journal on Selected Areas in Communications
Wavelength conversion in WDM networking
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairly general and allows each source-destination pair to serve calls of different classes, with each call occupying one wavelength per link. Our approach involves two steps. The arrival process of calls on some routes is first modified slightly to obtain an approximate multi-class network model. Next, all classes of calls on a particular route are aggregated to give an equivalent single-class model. Thus, path decomposition algorithms for single-class networks may be extended to the multi-class case. Our work is a first step towards understanding the issues arising in wavelength routing networks that serve multiple classes of customers.