Résumé en anglais

We consider the following survivable IP-over-optical network design problem. Given a set of demands and two node-disjoint paths routing each demand in the IP layer, the problem is to find for each demand two node-disjoint paths in the optical layer going through the optical switches corresponding to the routers visited in the IP layer paths and respecting the same order. We give two integer programming formulations: a cut formulation and a path formulation. We discuss the polyhedron associated with the first one and the pricing problem of the latter and present some computational results.