New Algorithms for Working and Spare Capacity Assignment in Integrated Self-Healing Networks


IEICE TRANSACTIONS on Communications   Vol.E86-B   No.4   pp.1346-1355
Publication Date: 2003/04/01
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
self-healing networks,  SONET/SDH,  capacity assignment,  network planning,  shortest paths,  

Full Text: PDF>>
Buy this Article

Modern network technologies gave rise to intelligent network reconfiguration schemes for restoration purposes and several network self-healing schemes, exploiting the capabilities of network elements (NE), have already been proposed. Each self-healing scheme has its own characteristics, regarding restoration time, flexibility, restoration cost and exploitation of NEs. Integrated self-healing networks, which combine more than one survivability techniques, mainly the Shared Self-Healing Rings (SSR) with the Dynamic Self-Healing Networks (DSN), can achieve higher network survivability and cost-effective network design. In this paper, we propose two algorithms for the design of spare and working channel capacities for integrated self-healing networks. In the first algorithm, A1, we do not take into account the capacity of network nodes, while in the second algorithm, A2, we take into account the limited capacity of network nodes. These algorithms are based on the shortest path principles, similarly to a previous algorithm (old algorithm) proposed by scientists of NEC Corporation for integrated self-healing network design. By the new algorithms we achieve more savings than by the old algorithm in total network capacity. On the other hand, strong motivation for the development of the new algorithms is the fact that the procedural steps of the old algorithm are not homogeneous; the old algorithm incorporates both heuristics and analytical methods, in contrast to the new algorithms that are pure heuristics. Moreover, we introduce restrictions in node-capacities of the network that they were not included in the old algorithm.