
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

New Algorithms for Working and Spare Capacity Assignment in Integrated SelfHealing Networks
Michael LOGOTHETIS Ioannis NIKOLAOU
Publication
IEICE TRANSACTIONS on Communications
Vol.E86B
No.4
pp.13461355 Publication Date: 2003/04/01 Online ISSN:
DOI: Print ISSN: 09168516 Type of Manuscript: PAPER Category: Network Keyword: selfhealing networks, SONET/SDH, capacity assignment, network planning, shortest paths,
Full Text: PDF>>
Summary:
Modern network technologies gave rise to intelligent network reconfiguration schemes for restoration purposes and several network selfhealing schemes, exploiting the capabilities of network elements (NE), have already been proposed. Each selfhealing scheme has its own characteristics, regarding restoration time, flexibility, restoration cost and exploitation of NEs. Integrated selfhealing networks, which combine more than one survivability techniques, mainly the Shared SelfHealing Rings (SSR) with the Dynamic SelfHealing Networks (DSN), can achieve higher network survivability and costeffective network design. In this paper, we propose two algorithms for the design of spare and working channel capacities for integrated selfhealing 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 selfhealing 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 nodecapacities of the network that they were not included in the old algorithm.

