A Distributed Priority Based Routing Algorithm for Dynamic Traffic in Survivable WDM Networks

Summary 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. The routing of high priority traffic is performed over the lightly loaded links, in such a manner that the links with lighter loads are chosen instead of links with heavier-loads whilst routing the primary and backup paths. In addition, the resources can be shared between the high priority traffic’s backup path and low priority traffic. Based on the simulation results, it has bee shown that the distributed priority based routing algorithm reduces the blocking probability and latency by means of increased throughput and channel

[1]  Biswanath Mukherjee,et al.  Fault management in IP-over-WDM networks: WDM protection versus IP restoration , 2002, IEEE J. Sel. Areas Commun..

[2]  Yonggang Wen,et al.  Efficient fault-diagnosis algorithms for all-optical WDM networks with probabilistic link failures , 2005, Journal of Lightwave Technology.

[3]  Arun K. Somani.  Dynamic Routing in Survivable WDM Networks , 2002 .

[4]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks , 2003 .

[5]  Chang Liu,et al.  A dynamic routing algorithm with load balancing heuristics for restorable connections in WDM networks , 2004, IEEE Journal on Selected Areas in Communications.

[6]  Mario Martinelli,et al.  Routing Algorithms in WDM Networks under Mixed Static and Dynamic Lambda-Traffic , 2004, Photonic Network Communications.

[7]  Lei Guo.  Heuristic Survivable Routing Algorithm for Multiple Failures in WDM Networks , 2007, 2007 2nd IEEE/IFIP International Workshop on Broadband Convergence Networks.

[8]  Yonggang Wen,et al.  Efficient Fault Diagnosis Algorithms for All-Optical WDM Networks , 2022 .

[9]  Harsha V. Madhyastha,et al.  An efficient algorithm for virtual-wavelength-path routing minimizing average number of hops , 2003, IEEE J. Sel. Areas Commun..

[10]  Xiaohong Jiang,et al.  A hybrid algorithm for dynamic lightpath protection in survivable WDM optical networks , 2005, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05).

[11]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

[12]  C. Siva Ram Murthy,et al.  Routing and wavelength assignment for establishing dependable connections in WDM networks , 1999, Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (Cat. No.99CB36352).

[13]  Biswanath Mukherjee,et al.  Optical WDM Networks , 2006 .

[14]  Patrick Thiran,et al.  Survivable Routing in IP-over-WDM Networks in the Presence of Multiple Failures , 2006, ArXiv.