A Lagrangian Approach for Integrated Network Design and Routing in IP Networks ∗

  title={A Lagrangian Approach for Integrated Network Design and Routing in IP Networks ∗},
  author={Andreas Bley Konrad-Zuse-Zentrum},
  • Andreas Bley Konrad-Zuse-Zentrum
  • Published 2003
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 traffic demands. Al l 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… CONTINUE READING


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 10 references

Kiwiel, A spectral bundle method with bounds

K.C.C. Helmberg
Mathematical Programming • 2002

On optimization in design of telecommunications networks with multicast and unicast traffic

M. Prytz
Ph.D. thesis, Royal Institute of Technology, • 2002

Fast heuristics for optimal routing in large IP networks

L. Berry, S. K ̈ohler, D. Staehle, P. Tran-Gia
Tech. report, Department of Computer Science, University of Wu ̈rzburg, • 2000

NetScope: Traffic engineering for IP networks

A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford
IEEE Network • 2000

Minimax open shortest path first routing algorithms in networks suporting the SMDS service

F.Y.S. Lin, J. L. Wang
Tech. report, Bell Communications Research, • 1993

Similar Papers

Loading similar papers…