A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Two Tree-Based Algorithms for Network Spare Capacity Design
2007
Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)
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
doi:10.1109/pdcat.2007.4420181
fatcat:rbra3zhomvbgnpaxde3w3iu5xm