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

Alexandria, Egypt June 28-July 01

RSS feed for this publication

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ISCC.2004.1358664

Ninth IEEE Symposium on Computers and ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by G. Retvdri Articles by J.J. Biro Articles by T. Cinkler

	ASCII Text	x
	G. Retvdri, J.J. Biro, T. Cinkler, "A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering," Computers and Communications, IEEE Symposium on, vol. 2, pp. 957-962, Ninth IEEE Symposium on Computers and Communications 2004 Volume 2 (ISCC"04), 2004.

	BibTex	x
	@article{ 10.1109/ISCC.2004.1358664, author = {G. Retvdri and J.J. Biro and T. Cinkler}, title = {A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering}, journal ={Computers and Communications, IEEE Symposium on}, volume = {2}, year = {2004}, isbn = {0-7803-8623-X}, pages = {957-962}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2004.1358664}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computers and Communications, IEEE Symposium on TI - A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering SN - 0-7803-8623-X SP957 EP962 A1 - G. Retvdri, A1 - J.J. Biro, A1 - T. Cinkler, PY - 2004 VL - 2 JA - Computers and Communications, IEEE Symposium on ER -

G. Retvdri, Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary

J.J. Biro, Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary

T. Cinkler, Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary

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.

Citation:

G. Retvdri, J.J. Biro, T. Cinkler, "A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering," iscc, vol. 2, pp.957-962, Ninth IEEE Symposium on Computers and Communications 2004 Volume 2 (ISCC"04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.