Design of hierarchical self-healing ring networks

Abstract

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. >