A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering

Authors:
G. Retvdri;J. J. Biro;T. Cinkler
Affiliations:
Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary;Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary;Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary
Venue:
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Year:
2004

Citing 0
Cited 2

Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks

Computational Optimization and Applications
On shortest path representation

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The minimum cost multicommodity flow problem plays a central role in today's operations research theory with applications ranging from transportation and logistics to telecommunications network routing. In this paper, we introduce a novel Lagrangian-relaxation technique, which, given an initial feasible solution, can solve the minimum cost multicommodity flow problem as a sequence of single-commodity flow problems. Our methodology is best suited for OSPF traffic engineering, because it can rapidly improve a given path set towards approximate optimality while simultaneously provides the link weights, which implement the paths as shortest paths.