A traffic grooming problem considering hub location for synchronous optical network-wavelength division multiplexing networks

In this paper, we deal with a traffic demand clustering problem for designing SONET-WDM rings. The objective is to minimize the total cost of optical add-drop multiplexers (OADMs) and inter-ring hub equipments, while satisfying intra-ring and inter-ring capacities. Also, the minimum number of nodes, for example three, for each ring should be satisfied. We develop an integer programming (IP) formulation for the problem and develop some valid inequalities that provide a tight lower bound for the problem. Dealing with the inherent computational complexity of the problem, we also devise an effective tabu search procedure for finding a feasible solution of good quality within reasonable computing time. Computational results are provided to demonstrate the efficacy of the lower and upper bound procedures for solving the problem.

[1]  Hanif D. Sherali,et al.  Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting , 2000, INFORMS J. Comput..

[2]  Donghan Kang,et al.  Design of local networks using USHRs , 2000, Telecommun. Syst..

[3]  Bernard Fortz,et al.  A tabu search algorithm for self-healing ring network design , 2003, Eur. J. Oper. Res..

[4]  Mauro Dell'Amico,et al.  Comparing Metaheuristic Algorithms for Sonet Network Design Problems , 2005, J. Heuristics.

[5]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[6]  Eli V. Olinick,et al.  SONET/SDH Ring Assignment with Capacity Constraints , 2003, Discret. Appl. Math..

[7]  Hanif D. Sherali,et al.  Improving Discrete Model Representations via Symmetry Considerations , 2001, Manag. Sci..

[8]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[9]  Jian Wang,et al.  Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections , 2001 .

[10]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[11]  Jian Wang,et al.  Improved approaches for cost-effective traffic grooming in WDM ring networks: nonuniform traffic and bidirectional ring , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[12]  Jian Wang,et al.  Improved Approaches for Cost-Effective Traffic Grooming in WDM Ring Networks: Uniform-Traffic Case* , 2001, Photonic Network Communications.

[13]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[14]  Dong-wan Tcha,et al.  Cost-minimizing construction of a unidirectional SHR with diverse protection , 1996, TNET.

[15]  Thomas R. Stidsen,et al.  Hierarchical Ring Network Design Using Branch-and-Price , 2005, Telecommun. Syst..

[16]  H. Sherali,et al.  A Branch-and-Cut Algorithm for Solving an Intraring Synchronous Optical Network Design Problem , 2000 .