A Lagrangian Approach for Integrated Network Design and Routing in IP Networks
Please always quote using this URN:urn:nbn:de:0296-matheon-2344
- We consider the problem of designing a network that employs a non-bifurcated shortest path routing protocol. The network's nodes and the set of potential links are given together with a set of forecasted endto- end traffc demands. All relevant hardware components installable at links or nodes are considered. The goal is to simultaneously choose the network's topology, to decide which hardware components to install on which links and nodes, and to find appropriate routing weights such that the overall network cost is minimized. In this paper, we present a mathematical optimization model for this problem and an algorithmic solution approach based on a Lagrangian relaxation. Computational results achieved with this approach for several real-world network planning problems are reported.
Author: | Andreas Bley |
---|---|
URN: | urn:nbn:de:0296-matheon-2344 |
Referee: | Martin Grötschel |
Document Type: | Preprint, Research Center Matheon |
Language: | English |
Date of first Publication: | 2005/10/03 |
Release Date: | 2005/10/03 |
Institute: | Zuse Institute Berlin (ZIB) |
Preprint Number: | 228 |