Ring Network Design

Applying traditional methods of network design on modern telecommunication data often results in tree-like structures, due to the high capacities of the current optical fibers. However, the increasing importance of the traffic on telecommunication networks makes the issue of survivability more crucial. It is not acceptable that parts of the network are completely unable to communicate if a single link failure should occur. Therefore telecommunication networks must be designed so that certain survivability requirements are fulfilled. In this chapter we study the case where the survivability requirement is that the network should be composed of connected rings of links. In case of a failure in a ring, the traffic can simply be sent the other way around the ring. We describe a solution approach iteratively generating rings in a meaningful way, as the number of possible rings is very large. A model deciding the optimal usage of a given set of rings and a model generating valid rings are used together, to form a method of column generation-type. We also review work on other types of ring network design problems.

[1]  June S. Park,et al.  Interconnecting LANs and a FDDI Backbone Using Transparent Bridges: A Model and Solution Algorithms , 1998, INFORMS J. Comput..

[2]  Amitava Dutta,et al.  Design of partially survivable networks for cellular telecommunication systems , 1999, Eur. J. Oper. Res..

[3]  Kemal Altinkemer,et al.  Topological design of ring networks , 1994, Comput. Oper. Res..

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

[5]  Piet Demeester,et al.  WDM network planning in a changing environment , 1999 .

[6]  E. Modiano,et al.  Efficient routing and wavelength assignment for reconfigurable WDM networks with wavelength converters , 2005, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Joakim Kalvenes,et al.  Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approach , 1996, Telecommun. Syst..

[8]  Yuanyuan Yang,et al.  Load-balanced routing in counter rotated SONET rings , 2000, Networks.

[9]  Gilbert Laporte,et al.  Efficient heuristics for the design of ring networks , 1995, Telecommun. Syst..

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

[11]  Bezalel Gavish,et al.  LP-Based Heuristic Algorithms for Interconnecting Token Rings via Source Routing Bridges , 2000, J. Heuristics.

[12]  Soo Y. Chang,et al.  A heuristic method for self‐healing ring design in a single‐homing cluster , 2000, Telecommun. Syst..

[13]  Mikael Rönnqvist,et al.  A ring network design problem and heuristics for generating a set of feasible rings , 2003 .

[14]  Francesco Maffioli,et al.  Solving the Two-Connected Network with Bounded Meshes Problem , 2000, Oper. Res..

[15]  S. Bortolon,et al.  A methodology to SDH networks design using optimization tools , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[16]  Mathias Henningsson.  Ring network design in telecommunications : optimization based solution approaches , 2003 .

[17]  Alain Sutter,et al.  Increased capacity in an MS protection ring using WDM technique and OADM: the 'coloured section' ring , 1996 .

[18]  Seok Joo Koh,et al.  A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach , 1997, Comput. Oper. Res..

[19]  Steven Chamberland,et al.  Heuristics for ring network design when several types of switches are available , 1997, Proceedings of ICC'97 - International Conference on Communications.

[20]  F. Maffioli,et al.  On prize-collecting tours and the asymmetric travelling salesman problem , 1995 .

[21]  Mikael Rönnqvist,et al.  A ring network design problem solved by a ring generation and allocation approach , 2003 .

[22]  Iraj Saniee,et al.  SONET Toolkit: A Decision Support System for Designing Robust and Cost-Effective Fiber-Optic Networks , 1995 .

[23]  G. Schneidereit,et al.  Ring network design for metropolitan area , 1998 .

[24]  G. D. Smith,et al.  Genetic algorithms and network ring design , 1999, Ann. Oper. Res..

[25]  Lawrence Davis,et al.  Reducing costs of backhaul networks for PCS networks using genetic algorithms , 1997, J. Heuristics.

[26]  Jianxu Shi,et al.  Design of hierarchical self-healing ring networks , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[27]  Kaj Holmberg,et al.  Lagrangean price directive ring generation for network design , 2003 .

[28]  Kaj Holmberg,et al.  Calculating cost coefficients for generation of rings in network design , 2003 .

[29]  Michel Gendreau,et al.  Design and Dimensioning of Survivable SDH/Sonet Networks , 1999 .

[30]  Peng-Jun Wan,et al.  Load-Balanced Routing in Counter Rotated SONET Rings , 2000 .

[31]  Brunilde Sansò,et al.  Topological expansion of multiple-ring metropolitan area networks , 2000 .

[32]  Charles E. Noon,et al.  An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint , 1992 .

[33]  Laurence A. Wolsey,et al.  Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms , 1998, Oper. Res..

[34]  M. C. Sinclair,et al.  Design and dimensioning of dual-homing hierarchical multi-ring networks , 2000 .

[35]  Dicky C. K. Yan,et al.  Designing tributary networks with multiple ring families , 1998, Comput. Oper. Res..

[36]  W.D. Grover,et al.  Current approaches in the design of ring-based optical networks , 1999, Engineering Solutions for the Next Millennium. 1999 IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.99TH8411).

[37]  Paolo Toth,et al.  Algorithm 750: CDT: a subroutine for the exact solution of large-scale, asymmetric traveling salesman problems , 1995, TOMS.

[38]  Peter Kubat,et al.  Multicommodity Flows in Ring Networks , 1996, INFORMS J. Comput..

[39]  Martine Labbé,et al.  Polyhedral results for two-connected networks with bounded rings , 2002, Math. Program..

[40]  Kaj Holmberg,et al.  A ring generation problem based on the traveling salesman subtour problem , 2003 .

[41]  R. H. Cardwell,et al.  Survivable SONET networks-design methodology , 1994, IEEE J. Sel. Areas Commun..

[42]  Andreas Westerlund.  Decomposition schemes for the traveling salesman subtour problem , 2002 .

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

[44]  Anna Sciomachen,et al.  A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem , 1998, Ann. Oper. Res..

[45]  Dennis H. Gensch,et al.  An Industrial application of the traveling salesman's subtour problem , 1978 .

[46]  Jiefeng Xu,et al.  Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search , 1999 .

[47]  Claudio Arbib,et al.  An optimization problem arising in the design of multiring systems , 2000, Eur. J. Oper. Res..

[48]  Dong-Wan Tcha,et al.  Optimal Load Balancing on Sonet Bidirectional Rings , 1997, Oper. Res..

[49]  Nachimuthu Karunanithi,et al.  Sonet ring sizing with genetic algorithms , 1997, Comput. Oper. Res..

[50]  Mikael Rönnqvist,et al.  Ring Network Design by Lagrangean Based Column Generation , 2002, Telecommun. Syst..

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

[52]  O. J. Wasem,et al.  An algorithm for designing rings for survivable fiber networks , 1991 .

[53]  Chae Y. Lee,et al.  Balancing loads on sonet rings with integer demand splitting , 1997, Comput. Oper. Res..

[54]  Eytan Modiano,et al.  Efficient routing and wavelength assignment for reconfigurable WDM networks , 2002, IEEE J. Sel. Areas Commun..

[55]  Wayne D. Grover,et al.  An algorithm for survivable network design employing multiple self-healing rings , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

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

[57]  T. Flanagan,et al.  Fiber network survivability , 1990, IEEE Communications Magazine.

[58]  Optimization Based Algorithms for Finding Minimal Cost Ring Covers in Survivable Networks , 1999, Comput. Optim. Appl..

[59]  B. Shepherd,et al.  A cycle augmentation algorithm for minimum cost multicommodity flows on a ring , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).