Two Tree-Based Algorithms for Network Spare Capacity Design

Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capacity reservation at certain survivability level. In this paper, we introduce two pre-planned path restoration algorithms for spare capacity design in mesh-like networks. First one is a spanning tree based algorithm, which needs less spare capacity than the well known hierarchical tree algorithm while keeping the same level of restorability. The second algorithm is a cycle based tree algorithm with backup parents and extra cycle edges, which forms cycles with the original spanning tree edges. Simulation results show that this algorithm works much better than the other two algorithms on restorability. Both algorithms have time complexity O(n3 ) and space complexity O(n2 ), where n is the total number of nodes in the network.

• Type: Conference
• Year: 2007
• Where: PDCAT
• Authors: Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan Zhang
• Keywords: Algorithms, Distributed And Parallel Computing, PDCAT 2007, Spare Capacity, Tree Algorithm