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

Gábor Rétvári, József J. Bíró, Tibor Cinkler

Research output: Contribution to journalConference article

8 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)957-962
Number of pages6
JournalProceedings - International Symposium on Computers and Communications
Volume2
Publication statusPublished - Dec 1 2004
EventProceedings - ISCC 2004, Ninth International Symposium on Computers and Communications - Alexandria, Egypt
Duration: Jun 28 2004Jul 1 2004

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Mathematics(all)
  • Computer Science Applications
  • Computer Networks and Communications

Cite this