Abstract
Path restoration scheme can be used in augmenting existing telecommunication networks with adequate spare capacity to achieve a desired level of protection against link failures. Path restoration planning corresponds to the multi-commodity flow problem, which is computationally hard. In this paper, we present the details of an approximation scheme for the path based restoration planning problem and an implementation. We then compare the performance of link and path restoration schemes. These schemes have been incorporated into the network planning tool under development at Alcatel Network Systems.