Design and Dimensioning of Survivable SDH/Sonet Networks

Basically, a telecommunications network may be represented as a graph where the edges correspond to transmission cables carrying information (signals) between nodes that represent users. Associated to each pair of users there is an integer valued traffic demand which must flow through this network. Building a network in which all customers are directly connected to one another is clearly not a realistic solution due to the huge amount of cables needed to convey all the demands. Consequently, individual signals are grouped into larger aggregate signals, also called frames, and high capacity transmission equipments may then be used to transport demands more efficiently. In technical language, this grouping operation is called multiplexing and the opposite operation which consists in extracting initial information from a high capacity frame is called demultiplexing.

[1]  George G. Polak,et al.  Multi-Hour Dimensioning In Non-Hierarchical Telecommunications Networks , 1999 .

[2]  M. Minoux.  Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements* , 1981 .

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

[4]  Hanan Luss,et al.  Design of Stacked Self-Healing Rings Using a Genetic Algorithm , 2000, J. Heuristics.

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

[6]  SanieeIraj,et al.  An optimization problem related to balancing loads on SONET rings , 1994 .

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

[8]  M. Stoer.  Design of Survivable Networks , 1993 .

[9]  T.-H. Wu,et al.  SONET ring applications for survivable fiber loop networks , 1991, IEEE Communications Magazine.

[10]  M. Herzberg,et al.  A decomposition approach to assign spare channels in self-healing networks , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[11]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[12]  Tsong-Ho Wu,et al.  Fiber Network Service Survivability , 1992 .

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

[14]  John C. McDonald,et al.  Public network integrity-avoiding a crisis in trust , 1994, IEEE J. Sel. Areas Commun..

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

[16]  W. D. Grover,et al.  Comparative Methods and Issues In Design of Mesh-Restorable STM and ATM Networks , 1999 .

[17]  アンドレオッジ，パオロ,et al.  Self-healing network , 1996 .

[18]  Martine Labbé,et al.  Network Synthesis with Non-Simultaneous Multicommodity Flow Requirements: Bounds and Heuristics , 1999 .

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

[20]  R. H. Cardwell,et al.  Software for designing survivable SONET networks using self-healing rings , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

[21]  Gilbert Laporte,et al.  Covering a graph with cycles , 1998, Comput. Oper. Res..

[22]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

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

[24]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[25]  Hanan Luss,et al.  Topological network design for SONET ring architecture , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[26]  Hong Wang,et al.  Covering a graph with cycles , 1995, J. Graph Theory.

[27]  Bezalel Gavish,et al.  Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..

[28]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.

[29]  M. Stoer,et al.  A polyhedral approach to multicommodity survivable network design , 1994 .

[30]  M. Minoux,et al.  Synthèse optimale d’un réseau de télécommunication avec contraintes de sécurité , 1981 .

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

[32]  HerzbergMeir,et al.  The hop-limit approach for spare-capacity assignment in survivable networks , 1995 .

[33]  M. Gendreau,et al.  Fondements et applications des méthodes de recherche avec tabous , 1994 .

[34]  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.

[35]  Gilles Pesant,et al.  An Optimal Strategy for the Constrained Cycle Cover Problem , 1999, Electron. Notes Discret. Math..

[36]  Brunilde Sansò,et al.  Issues In ATM Network Planning: An Operations Research Perspective , 1999 .

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

[38]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[39]  Abdel Lisser,et al.  Optimal Joint Synthesis of Base and Reserve Telecommunication Networks , 1995 .

[40]  Krishnaiyan Thulasiraman,et al.  A SIMPLEX SOLUTION TO THE MINIMUM COST NONSIMULTANEOUS MULTI-COMMODITY FLOW PROBLEM. , 1994 .

[41]  Thomas L. Magnanti.  NETWORK DESIGN AND TRANSPORTATION PLANNING , 1990 .

[42]  Jeffery L. Kennington,et al.  An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network , 1999, INFORMS J. Comput..

[43]  Thomas L. Magnanti,et al.  Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .

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

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

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

[47]  Michael J. Sexton,et al.  Transmission Networking: Sonet and the Synchronous Digital Hierarchy , 1992 .

[48]  J. G. Klincewicz,et al.  HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .

[49]  Brunilde Sansò,et al.  Telecommunications Network Planning , 1998 .

[50]  R. H. Cardwell,et al.  Survivable network architectures for broad-band fiber optic networks: model and performance comparison , 1988 .

[51]  Hyong S. Kim,et al.  Joint optimization of capacity and flow assignment for self-healing ATM networks , 1995, Proceedings IEEE International Conference on Communications ICC '95.

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

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

[54]  Hideki Sakauchi,et al.  A self-healing network with an economical spare-channel assignment , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[55]  Wayne D. Grover,et al.  Near optimal spare capacity planning in a mesh restorable network , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[56]  T. C. Hu,et al.  Synthesis of a Communication Network , 1964 .

[57]  Moshe Dror,et al.  Fiberoptic circuit network design under reliability constraints , 1989, IEEE J. Sel. Areas Commun..

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

[59]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in mesh survivable networks , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.