Path restoration scheme can be used i n augmenting existing telecommunication networks with adequate spare capacity t o achieve a desired level of protect ion against link failures. Path restoration planning corresponds t o the mult i -commodity flow problem, which is computationally hard. In this paper, we present the details of an approximation scheme f o r the path based restoration planning problem and an implementat ion. W e 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 Sys tems.