Combiner Queues for Survivability in Optical WDM Mesh Network

Abstract

Survivability is the major problem in Wavelength Division Multiplexed (WDM) Optical network. Also, the selection of grooming node is another important issue in the Optical Mesh Network. Most of the work in the field of the optical network is focused of sparse traffic grooming and survivability as a separate issue. We here presented a novel approach for providing survivability to sparse traffic grooming. This survivability on sparse traffic grooming is considered for the failure of a link on sparse grooming network. When we have sparse grooming network and a link failure occurs then we are providing a solution of shared link using combiner queues. We have proved that the combiner queues help to reduce the blocking probability and also reduce the number of call dropping. We have presented the queuing model which helps to calculate the total requests at a node or in the entire network. The presented combiner queuing model is useful for the calculation of probabilities, as m server queuing system.