Solving SONET Problems Using a Hybrid Scatter Search Algorithm

Nowadays the Synchronous Optical NETworking (SONET) standard is widely used in telecommunications. In this paper we consider three problems that arise in SONET networks: (1) Weighted Ring Edge-Loading Problem (WRELP), (2) SONET Ring Assignment Problem (SRAP) and, (3) Intraring Synchronous Optical Network Design Problem (IDP), known to be NP-hard. WRELP asks for a routing scheme such that the maximum load on the edges of a ring will be minimum. In SRAP the objective is to minimise the number of rings (i.e., DXCs). In IDP the objective is to minimise the number of ADMs. The last two problems are subject to a ring capacity constraint. We study these three problems without demand splitting and for solving them we propose a Hybrid Scatter Search (HSS) algorithm. Coupled with the Scatter Search algorithm, we use a Tabu Search algorithm to locate the global minimum. We show that HSS is able to achieve feasible solutions, improving the results obtained by previous approaches.

[1]  Hu-Gon Kim,et al.  On the ring loading problem with demand splitting , 2004, Oper. Res. Lett..

[2]  Peter Winkler,et al.  The Ring Loading Problem , 1998, SIAM Rev..

[3]  Miguel A. Vega-Rodríguez,et al.  Solving the Ring Arc-Loading Problem using a Hybrid Scatter Search Algorithm , 2010, IJCCI.

[4]  Miguel A. Vega-Rodríguez,et al.  A Hybrid Scatter Search algorithm to assign terminals to concentrators , 2010, IEEE Congress on Evolutionary Computation.

[5]  Manuel Laguna,et al.  Clustering for the design of SONET rings in interoffice telecommunications , 1994 .

[6]  Fred Glover,et al.  Scatter Search and Path Relinking: Advances and Applications , 2003, Handbook of Metaheuristics.

[7]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[8]  Mauro Dell'Amico,et al.  Solution of the SONET Ring Assignment Problem with Capacity Constraints , 2005 .

[9]  Miguel A. Vega-Rodríguez,et al.  Solving ring loading problems using bio-inspired algorithms , 2011, J. Netw. Comput. Appl..

[10]  Luiz Satoru Ochi,et al.  A Genetic Algorithm with Evolutionary Path-relinking for the SONET Ring Assignment Problem , 2008 .

[11]  Pascal Van Hentenryck,et al.  Sonet Network Design Problems , 2009, LSCS.

[12]  Biing-Feng Wang,et al.  Linear time algorithms for the ring loading problem with demand splitting , 2005, J. Algorithms.

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

[14]  Dorit S. Hochbaum,et al.  The SONET edge-partition problem , 2003, Networks.

[15]  Luiz Satoru Ochi,et al.  GRASP with path-relinking for the SONET ring assignment problem , 2005, Fifth International Conference on Hybrid Intelligent Systems (HIS'05).

[16]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

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

[18]  Iraj Saniee,et al.  An optimization problem related to balancing loads on SONET rings , 1994, Telecommun. Syst..

[19]  Cid C. de Souza,et al.  A column generation approach for SONET ring assignment , 2006 .

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

[21]  Mauro Dell'Amico,et al.  Exact solution of the SONET Ring Loading Problem , 1999, Oper. Res. Lett..