A telecommunication network is survivable if, following an arc failure, the interrupted traac can be redirected through the network via existing excess capacity. The standard survivability problem consists in nding the least cost investment in spare capacity to allow rerouting of a given base traac. In this paper we consider the more involved problem of simultaneously designing the base traac and the spare capacity investment. If the investment costs are linear, the problem can be formulated as a large scale structured linear program that we solve using diierent decomposition techniques, including the analytic center cutting plane method. The global analysis is performed under the assumption of local rerouting of the traac, i.e., the interrupted traac creates a local demand between the end points of the broken edge. More sophisticated telecommunication network management allows to break down the interrupted traac into its individual demand components. We do not treat the simultaneous design of the base traac and the spare capacity under a global rerouting strategy. We propose a two-step procedure. We determine rst the base traac and the spare capacity under the local rerouting strategy. We then compute the necessary spare capacity to secure the base traac under the global rerouting strategy. Our solution techniques are tested on a set of realistic problems.
[1]
Liang T. Wu,et al.
Using distributed topology update and preplanned configurations to achieve trunk network survivability
,
1991
.
[2]
G. Sonnevend.
New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation
,
1988
.
[3]
Jean-Philippe Vial,et al.
A cutting plane method from analytic centers for stochastic programming
,
1995,
Math. Program..
[4]
Narendra Karmarkar,et al.
A new polynomial-time algorithm for linear programming
,
1984,
STOC '84.
[5]
N. S. Barnett,et al.
Private communication
,
1969
.
[6]
Abdel Lisser,et al.
Survivability in Telecommunication Networks
,
1995
.
[7]
G. Dantzig,et al.
The decomposition algorithm for linear programming: notes on linear programming and extensions-part 57.
,
1961
.
[8]
J. E. Kelley,et al.
The Cutting-Plane Method for Solving Convex Programs
,
1960
.
[9]
J. Goffin,et al.
Cutting planes and column generation techniques with the projective algorithm
,
1990
.