Joint optimization of capacity and flow assignment for self-healing ATM networks

This paper addresses an optimal link capacity design problem for self-healing ATM networks. Given a projected traffic demand capacity and flow assignment is jointly optimized to find a truly optimal capacity placement. The problem can be formulated as a large-scale linear programming. The basis matrix can be readily factorized into an LU form by taking advantage of its special structure, which results in a great reduction on the computation time of the revised simplex method. The proposed method was tested on two sample networks for several random traffic demands. The results indicate that a significant amount of cost saving is possible through the joint optimization