Diverse routing for survivability in a fiber-based sparse network

The problem of obtaining optimal pairs of diverse routes to minimize cost for given demand, capacity, and bound requirements is addressed. The mathematical formulation of this problem yields a mixed-integer, multicommodity flow model which can be solved by a Lagrangian relaxation-based algorithm exploiting the structure of the problem. A preliminary study shows improvement in worst case network survivability with diverse routing