Budget management in network capacity planning

The problem of optimal link enhancement is crucial to the survivability and routability in networks. The process of link enhancement is usually subject to a budget constraint. In this paper, we present an efficient heuristic algorithm for budget management of network capacity planning. We first compress constrained sets to reduce the candidate search. The method of Lagrangian multipliers is used to formulate the problem as an unconstrained optimization problem. Furthermore, we employ a local search approach based upon Lagrangian relaxation to find the optimal link enhancement. The use of varying Lagrangian multipliers makes the local search easily reduce the effect of local maximum. Extensive simulation results demonstrate the capability of our approach to determine a good strategy of network link enhancement