Design of hierarchical self-healing ring networks

The design of hierarchical self-healing ring (HSHR) networks is considered. It is shown that the enumeration method, which finds the optimal configuration of HSHR at any given number of levels and given number of nodes on its single self-healing rings, minimizing total capacity required, can only be used for small networks due to the complexity. A heuristic algorithm to solve the near-optimal topology construction in HSHR networks is proposed. Numerical results show that the performance of the heuristic is satisfactory.<<ETX>>

[1]  J. Yamada,et al.  Intelligent path assignment control for network survivability and fairness , 1991, ICC 91 International Conference on Communications Conference Record.

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

[3]  Tsong-Ho Wu,et al.  A class of self-healing ring architectures for SONET network applications , 1992, IEEE Trans. Commun..

[4]  T.-H. Wu,et al.  A study of the economics, operations and applications of SONET self-healing ring architectures , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

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