Capacity Design Of Fast Path Restorable Optical Networks

The contribution of this paper is the development of algorithms for optical network capacity determination with restoration being directly taken into account. The problem is formulated as a generalization of the maximum concurrent flow problem that includes restoration requirements for the two different restoration models which are commonly used in optical networks with fast restoration requirements. We then develop fully polynomial approximation schemes that solve the restorable network capacity design problem.