Survivability In Telecommunication Networks

Abstract

It is proposed that traffic in a telecommunications network be secured in the event of a node or link failure by the rerouting of traffic over a reserve network. The problem consists of two related parts: the dimensioning of a reserve network, and the re-allocation, or rerouting of traffic. We formulate the problem as a linear programming problem of huge size which we solve using a cutting plane algorithm based on the concept of an analytic center. The method enables the solution of the survivability problem for networks with up to 60 nodes and 120 links, which allows a realistic modelling of France Telecom's Main Interconnection Network. Key words: Survivability in telecommunication networks, cutting plane methods, interior point methods, decomposition. FRANCE TELECOM, CNET, 38-40, Rue du General Leclerc, 92131, Issy les Moulineaux Cedex, France. y LOGILAB, HEC-Gen`eve, Universit'e de Gen`eve, 102 Bd Carl Vogt, CH-1211 Gen`eve 4, Suisse. z This work was financed by contract No 9...