Availability optimization in shared-backup path protected networks

Previous approaches for assessing network availability in a shared-backup path protected network are not guaranteed to provide best-case or optimum availability. By incorporating linear programming directly within the availability analysis approach, the algorithm presented herein seeks to provide the maximum network availability achievable, given a specified network capacity plan. We also investigate the relationship between the amount of spare capacity provided to the network and the resultant maximized availability. The algorithmic approach is tested on a suite of test case networks of varying scale and connectivity.