Integrated routing and grooming in GMPLS-based optical networks

Abstract

This paper proposes an integrated routing and grooming algorithm for IP over WDM networks. Assuming a peer model in GMPLS-Based optical networks, we take into account the combined topology and resource usage information on both IP and WDM layers. Based on a clustering technique called Blocking Island Paradigm, we propose an enhanced Blocking Island Graph (BIG) network model with Blocking Island Hierarchy (BIH) to abstract network resources. The main idea of the algorithm is to keep the integrity and load balance of related Blocking Islands. We also combine a cost function in the routing algorithm to groom traffic flows into active lightpaths. The complexity of the algorithm is analyzed to show its efficiency. In the simulation, we compare the algorithm with three other integrated routing algorithms in terms of blocking probability. The three algorithms are: the integrated min-hop (IMH) routing algorithm, the maximum open capacity (MOCA) routing algorithm and the IP-WDM grooming (IWG) algorithm. Simulation results show our algorithm has the best performance.