A Distributed Priority Based Routing Algorithm for Dynamic Traffic in Survivable WDM Networks
Dynamic routing of a restorable connection necessitates the presence of a pair of link-disjoint primary and backup lightpaths online once a connection request arrives at the network. Diverse traffic classes are processed by a large-scale optical network with dissimilar fault tolerance requirements. Several previous work recommend a preemptive multi-class routing scheme, without considering the varying loads of dynamic traffic. This paper proposes a new distributed priority based routing algorithm intended for a variety of traffic classes, which employs the concept of load balancing to establish the primary and backup lightpaths. The proposed algorithm calculates the cost metric on the basis of the load on the links. The dynamic traffic can be classified into high and low priority.