Abstract
The advent of fiber optic technology has increased concerns about the survivability of telecommunication networks. Survivability is the ability of a network to withstand and recover from failures. The techniques that have been proposed and used for survivability in optical networks can be classified under two general categories: predesigned protection and dynamic restoration. In the predesigned protection, Self-Healing Ring (SHR) is a very successful technique for survivable optical networks. SHRs are one of the more widely deployed survivable network architectures, particularly in metropolitan areas. In this thesis we study the network planning problem of bi-directional self-healing ring (BSHR), which is a network structure providing higher survivability when there is a failure on link or node. Given a network with nodes, links, and demand pairs, our target is to design an optimal network comprising rings, which use only the existing links to satisfy all demands. The routing paths of all demands are simultaneously determined. The objective is to minimize the total cost of the restoration networks. We propose two heuristic algorithms for larger networks. One is suitable for the network problem with the same ADMs facilities. The other is suitable for the network problem with different ADMs facilities. Computational results are given to show the performances by the proposed heuristic algorithms.