Abstract

International audience; In this paper, we present a novel polynomial time framework for the off-line flow allocation problem in MPLSTraffic Engineering (MPLS-TE) networks. This framework, named FATE (Flow Allocation for Traffic Engineering), encompasses different objectives that illustrate the operator needs for traffic engineering and provides advanced control over the quality of the solution. Typically, we consider minimizing congestion, bandwidth consumption and operational costs. FATE is based on linear programming and presents an efficient solution for the problem both in terms of computational complexity and approximation guarantees. Simulation results show that we can get an efficient trade-off between congestion and bandwidth consumption while having a reduced number of Label Switched Paths (LSPs) for various known topologies.


Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.1109/lanman.2005.1541532
https://hal.archives-ouvertes.fr/hal-02368183/document,
https://hal.archives-ouvertes.fr/hal-02368183/file/LANMAN05.pdf
http://ieeexplore.ieee.org/document/1541532,
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000001541532,
http://dx.doi.org/10.1109/LANMAN.2005.1541532,
https://dblp.uni-trier.de/db/conf/lanman/lanman2005.html#LahoudTT05,
https://academic.microsoft.com/#/detail/1554912280
Back to Top

Document information

Published on 01/01/2005

Volume 2005, 2005
DOI: 10.1109/lanman.2005.1541532
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?