Survivable IP Over WDM: An Efficient Mathematical Programming Problem Formulation

摘要

The problem of laying out a survivable IP network over a WDM network isconsidered. The links of the IP network are realized by unprotected lightpaths of the WDMnetwork, and the lightpaths must be routed so that the IP network remains connected after anyfault. Crochat and Le Boudec [2] introduced the problem for the case of single fiber-linkfailures, and Modiano and Narula-Tam [5] provided an integer linear programming problem(ILP) formulation. However, the ILP is difficult to solve. An alternative mixed integer linearprogramming (MILP) problem is provided that is easier to solve. In experiments, the runtimes of the MILP can be much faster. Variations of the MILP are also discussed that allowlightpaths to be protected, and can incorporate shared risk link groups.