Two-stage EDA-based approach for all optical WDM mesh network survivability under SRLG constraints

In this paper, a two-stage evolutionary algorithm is proposed to solve an NP-complete telecommunication problem-all optical wavelength-division multiplexing (WDM) mesh network survivability under shared-risk-link-group (SRLG) constraints. First of all, a novel greedy heuristic with two control parameters is developed to construct feasible solutions of the telecommunication problem. An estimation of distribution algorithm (EDA) with guided mutation is applied to search for optimum settings of the two control parameters in respective two stages. Given the found best control parameters, an optimal solution of the considered problem can be constructed by the greedy heuristic. Experimental results show that the proposed approach compares favorably against the best-known evolutionary-based algorithm in 26 out of 30 test instances in terms of solution quality within given time limit.

[1]  H. T. Mouftah,et al.  Spare capacity planning using survivable alternate routing for long-haul WDM networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[2]  Craig A. Tovey,et al.  On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers , 2004, Adapt. Behav..

[3]  C. Siva Ram Murthy,et al.  Efficient algorithms for routing dependable connections in WDM optical networks , 2001, TNET.

[4]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[5]  Jian-Qiang Hu,et al.  Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..

[6]  Daniel A. R. Chaves,et al.  Novel Adaptive Routing Algorithm for All-Optical Networks Based on Power Series and Particle Swarm Optimization , 2008 .

[7]  William E. Hart,et al.  Recent Advances in Memetic Algorithms , 2008 .

[8]  Chris Phillips,et al.  Chaotic Particle Swarm Optimization for Dynamic Routing and Wavelength Assignment in All-Optical WDM networks , 2009, 2009 3rd International Conference on Signal Processing and Communication Systems.

[9]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[10]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[11]  V. Anand,et al.  Particle Swarm Optimization for Routing and Wavelength Assignment in Optical Networks , 2006, 2006 IEEE Sarnoff Symposium.

[12]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[13]  Byrav Ramamurthy,et al.  Shared risk link Group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks , 2005, IEEE/ACM Transactions on Networking.

[14]  Muriel Médard,et al.  Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs , 1999, TNET.

[15]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[16]  Ali Hassan,et al.  Particle swarm optimization-based DRWA for wavelength continuous WDM optical networks using a novel fitness function , 2009, Artificial Intelligence Review.

[17]  Martin J. Oates,et al.  Telecommunications Optimization: Heuristic and Adaptive Techniques , 2000 .

[18]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[19]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[20]  D. Skrlec,et al.  Artificial immune systems in solving routing problems , 2003, The IEEE Region 8 EUROCON 2003. Computer as a Tool..

[21]  Chunming Qiao,et al.  A new PROMISE algorithm in networks with shared risk link groups , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[22]  Jonathan M. Pitts,et al.  Dynamic Routing and Wavelength Assignment using Hybrid Particle Swarm Optimization for WDM Networks , 2007 .

[23]  F. Richard Yu,et al.  An energy-efficient cooperative spectrum sensing scheme for cognitive radio networks , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[24]  Murat Alanyali,et al.  Provisioning algorithms for WDM optical networks , 1999, TNET.

[25]  Márk Jelasity,et al.  Peer-to-Peer Optimization in Large Unreliable Networks with Branch-and-Bound and Particle Swarms , 2009, EvoWorkshops.

[26]  Panos M. Pardalos,et al.  Handbook of Optimization in Telecommunications , 2006 .

[27]  Yuefeng Ji,et al.  Probability Convergence based Particle Swarm Optimization for Multiple Constrained QoS Multicast Routing , 2008, 2008 Fourth International Conference on Semantics, Knowledge and Grid.

[28]  Chris Phillips,et al.  Improved PSO-based Static RWA Solver Avoiding Premature Convergence , 2009 .

[29]  M. C. Sinclair.  Minimum cost wavelength-path routing and wavelength allocation using a genetic-algorithm/heuristic hybrid approach , 1999 .

[30]  Henry Y. K. Lau,et al.  An AIS-Based Dynamic Routing (AISDR) Framework , 2005, ICARIS.

[31]  David B. Fogel,et al.  Evolutionary Computation: The Fossil Record , 1998 .

[32]  Pablo Cortés,et al.  Viral systems: A new bio-inspired optimisation approach , 2008, Comput. Oper. Res..

[33]  Goran Z. Markovic,et al.  Routing and wavelength assignment in all-optical networks based on the bee colony optimization , 2007, AI Commun..

[34]  Qingfu Zhang,et al.  Evolutionary Algorithms Refining a Heuristic: A Hybrid Method for Shared-Path Protections in WDM Networks Under SRLG Constraints , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[35]  Gaoxi Xiao,et al.  Heuristic for the maximum disjoint paths problem in wavelength-routed networks with shared-risk link groups [Invited] , 2003 .

[36]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

[37]  Eiji Oki,et al.  A disjoint path selection scheme with shared risk link groups in GMPLS networks , 2002, IEEE Communications Letters.

[38]  Akebo Yamakami,et al.  Artificial Immune System to Find a Set of k -Spanning Trees with Low Costs and Distinct Topologies , 2007, ICARIS.

[39]  Alan S. Perelson,et al.  The immune system, adaptation, and machine learning , 1986 .

[40]  Biswanath Mukherjee,et al.  Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints , 2003, TNET.

[41]  M. C. Sinclair.  Minimum cost routing and wavelength allocation using a genetic-algorithm/heuristic hybrid approach , 1998 .

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

[43]  I. Y. Wang,et al.  The bandwidth allocation of ATM through genetic algorithm , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[44]  Jun Zhang,et al.  Discrete Particle Swarm Optimization for Multiple Destination Routing Problems , 2009, EvoWorkshops.

[45]  Jun Zhang,et al.  Swarm Intelligence Inspired Multicast Routing: An Ant Colony Optimization Approach , 2009, EvoWorkshops.

[46]  M. C. Sinclair,et al.  Evolving simple fault-tolerant routing rules using genetic programming , 1997 .

[47]  Chul Kim,et al.  Hierarchical restoration scheme for multiple failures in GMPLS networks , 2002, Proceedings. International Conference on Parallel Processing Workshop.

[48]  Byrav Ramamurthy,et al.  Shared-risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks: formulation and solution approaches , 2003, OptiComm: Optical Networking and Communications Conference.

[49]  Qingfu Zhang,et al.  An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.

[50]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[51]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[52]  David Corne,et al.  Telecommunications Optimization: Heuristic and Adaptive Computation Techniques , 2000 .