Two-level iterated local search for WDM network design problem with traffic grooming

Graphical abstractDisplay Omitted HighlightsA new mathematical formulation of the network design problem with traffic grooming (NDG) is presented.A two-level iterated local search (TL-ILS) algorithm is proposed to solve the NDG problem.A novel tree search based neighborhood construction and a fast evaluation method.A strengthening formulation of the NDG problem and a method to obtain the lower bound of the NDG.Results in comparison with CPLEX and lower bounds show the effectiveness of the TL-ILS algorithm. Two important problems arise in WDM network planning: network design to minimize the operation cost and traffic grooming to maximize the usage of the high capacity channels. In practice, however, these two problems are usually simultaneously tackled, denoted as the network design problem with traffic grooming (NDG). In this paper, a mathematical formulation of the NDG problem is first presented. Then, this paper proposes a new metaheuristic algorithm based on two-level iterated local search (TL-ILS) to solve the NDG problem, where a novel tree search based neighborhood construction and a fast evaluation method are proposed, which not only enhance the algorithm's search efficiency but also provide a new perspective in designing neighborhoods for problems with graph structures. Our algorithm is tested on a set of benchmarks generated according to real application scenarios. We also propose a strengthening formulation of the original problem and a method to obtain the lower bound of the NDG problem. Computational results in comparison with the commercial software CPLEX and the lower bounds show the effectiveness of the proposed algorithm.

[1]  Michel Gendreau,et al.  Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design , 2004, Ann. Oper. Res..

[2]  Arun K. Somani,et al.  Capacity fairness of WDM networks with grooming capabilities , 2000, Other Conferences.

[3]  Miguel A. Vega-Rodríguez,et al.  Multiobjective Metaheuristics for Traffic Grooming in Optical Networks , 2013, IEEE Transactions on Evolutionary Computation.

[4]  Francesco Palmieri,et al.  Selfish routing and wavelength assignment strategies with advance reservation in inter-domain optical networks , 2012, Comput. Commun..

[5]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[6]  George N. Rouskas,et al.  Hierarchical traffic grooming: A tutorial , 2014, Comput. Networks.

[7]  Jian-Qiang Hu,et al.  Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks , 2004, IEEE INFOCOM 2004.

[8]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[9]  Ahmed E. Kamal,et al.  Design and Provisioning of WDM Networks for Many-to-Many Traffic Grooming , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[10]  Ahmed E. Kamal,et al.  Design and Provisioning of WDM Networks With Many-to-Many Traffic Grooming , 2010, IEEE/ACM Transactions on Networking.

[11]  Jin-Kao Hao,et al.  A Multilevel Memetic Approach for Improving Graph k-Partitions , 2011, IEEE Transactions on Evolutionary Computation.

[12]  Bahram Alidaee,et al.  A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem , 2005, Transp. Sci..

[13]  Miguel A. Vega-Rodríguez,et al.  Applying MOEAs to solve the static Routing and Wavelength Assignment problem in optical WDM networks , 2013, Eng. Appl. Artif. Intell..

[14]  Michal Pioro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010 .

[15]  Francesco Palmieri,et al.  Constrained minimum lightpath affinity routing in multi-layer optical transport networks , 2010, J. High Speed Networks.

[16]  Teodor Gabriel Crainic,et al.  Multicommodity Capacitated Network Design , 1999 .

[17]  Fred W. Glover,et al.  Tabu search for dynamic routing communications network design , 1997, Telecommun. Syst..

[18]  Francesco Palmieri,et al.  A Minimum Cut Interference-based Integrated RWA Algorithm for Multi-constrained Optical Transport Networks , 2008, Journal of Network and Systems Management.

[19]  Masoud Yaghini,et al.  A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design , 2012, Appl. Soft Comput..

[20]  Fabio D'Andreagiovanni,et al.  A fast hybrid primal heuristic for multiband robust capacitated network design with multiple time periods , 2014, Appl. Soft Comput..

[21]  Yukio Takahashi,et al.  Routing design of tree‐shaped local public communication networks with high reliability and low cost , 1997, Telecommun. Syst..

[22]  Arun K. Somani,et al.  A generalized framework for analyzing time-space switched optical networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[23]  Ahmed E. Kamal,et al.  Approximation Algorithms for Many-to-Many Traffic Grooming in Optical WDM Networks , 2012, IEEE/ACM Transactions on Networking.

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

[25]  Teodor Gabriel Crainic,et al.  Bundle-based relaxation methods for multicommodity capacitated fixed charge network design , 2001, Discret. Appl. Math..

[26]  Celso C. Ribeiro,et al.  A biased random-key genetic algorithm for routing and wavelength assignment , 2011, J. Glob. Optim..

[27]  Faiz Hamid,et al.  A Polyhedral Approach for Solving Two Facility Network Design Problem , 2011, INOC.

[28]  B. Kaushik,et al.  Achieving maximum reliability in fault tolerant network design for variable networks , 2013, Appl. Soft Comput..

[29]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[30]  Yogesh Kumar Agarwal,et al.  Survivable network design with shared-protection routing , 2014, Eur. J. Oper. Res..

[31]  Teodor Gabriel Crainic,et al.  RELAXATIONS FOR MULTICOMMODITY CAPACITATED NETWORK DESIGN PROBLEMS. , 1994 .

[32]  Michel Gendreau,et al.  Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design , 2003, Oper. Res..

[33]  Bertrand M. T. Lin,et al.  Ant colony optimization for dynamic routing and wavelength assignment in WDM networks with sparse wavelength conversion , 2011, Eng. Appl. Artif. Intell..

[34]  Yogesh Kumar Agarwal,et al.  k-Partition-based facets of the network design problem , 2006 .

[35]  G.N. Rouskas,et al.  On Hierarchical Traffic Grooming in WDM Networks , 2008, IEEE/ACM Transactions on Networking.

[36]  Yong Wang,et al.  On the complexity and algorithm of grooming regular traffic in WDM optical networks , 2008, J. Parallel Distributed Comput..