Efficient Distributed Algorithm for RWA Using Path Protection

A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such formulations become computationally intractable for larger networks. In this paper, we present two heuristic algorithms for dynamic lightpath allocation, using both dedicated and shared path protection. The first is a centralized algorithm and the second is a distributed algorithm. The objective in both cases is to minimize the amount of resources (wavelengthlinks) needed to accommodate the new connection. We have tested our algorithms on a number of well-known networks and compared their performance to "optimal" solutions generated by ILPs. Experimental results show that our heuristics generate solutions that are within 15% of the optimal. Our approach is much faster and more scalable compared to existing ILP formulations.

• Type: Journal
• Year: 2006
• Where: JNW
• Authors: Arunita Jaekel, Ying Chen
• Keywords: Algorithms, Dynamic Lightpath Allocation, JNW 2006, Survivable Wdm Networks