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ó, T. Cinkler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 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
Title of host publicationProceedings - International Symposium on Computers and Communications
EditorsA. Puliafito, S. Papavassiliou
Pages957-962
Number of pages6
Volume2
Publication statusPublished - 2004
EventProceedings - ISCC 2004, Ninth International Symposium on Computers and Communications - Alexandria, Egypt
Duration: Jun 28 2004Jul 1 2004

Other

OtherProceedings - ISCC 2004, Ninth International Symposium on Computers and Communications
CountryEgypt
CityAlexandria
Period6/28/047/1/04

Fingerprint

Operations research
Network routing
Telecommunication networks
Logistics
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Rétvári, G., Bíró, J. J., & Cinkler, T. (2004). A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering. In A. Puliafito, & S. Papavassiliou (Eds.), Proceedings - International Symposium on Computers and Communications (Vol. 2, pp. 957-962)

A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering. / Rétvári, Gábor; Bíró, József J.; Cinkler, T.

Proceedings - International Symposium on Computers and Communications. ed. / A. Puliafito; S. Papavassiliou. Vol. 2 2004. p. 957-962.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rétvári, G, Bíró, JJ & Cinkler, T 2004, A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering. in A Puliafito & S Papavassiliou (eds), Proceedings - International Symposium on Computers and Communications. vol. 2, pp. 957-962, Proceedings - ISCC 2004, Ninth International Symposium on Computers and Communications, Alexandria, Egypt, 6/28/04.
Rétvári G, Bíró JJ, Cinkler T. A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering. In Puliafito A, Papavassiliou S, editors, Proceedings - International Symposium on Computers and Communications. Vol. 2. 2004. p. 957-962
Rétvári, Gábor ; Bíró, József J. ; Cinkler, T. / A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering. Proceedings - International Symposium on Computers and Communications. editor / A. Puliafito ; S. Papavassiliou. Vol. 2 2004. pp. 957-962
@inproceedings{295ca17e1b3d40979c3b6653da21977c,
title = "A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering",
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.",
author = "G{\'a}bor R{\'e}tv{\'a}ri and B{\'i}r{\'o}, {J{\'o}zsef J.} and T. Cinkler",
year = "2004",
language = "English",
volume = "2",
pages = "957--962",
editor = "A. Puliafito and S. Papavassiliou",
booktitle = "Proceedings - International Symposium on Computers and Communications",

}

TY - GEN

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

AU - Rétvári, Gábor

AU - Bíró, József J.

AU - Cinkler, T.

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=10844243971&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10844243971&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2

SP - 957

EP - 962

BT - Proceedings - International Symposium on Computers and Communications

A2 - Puliafito, A.

A2 - Papavassiliou, S.

ER -