Computing Blocking Probabilities in Multi-class Wavelength Routing Networks
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
| Hi-index | 0.00 |
We present an approximate analytical method to evaluate efficiently and accurately the blocking performance of wavelength routing networks with multiple classes of calls. The model is fairly general and allows each source-destination pair to service calls of different classes, with each call occupying one wavelength per link. Our approximate analytical 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 wavelength routing networks may be readily 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.