(Created page with " == Abstract == International audience; In this paper, we present a novel polynomial time framework for the off-line flow allocation problem in MPLSTraffic Engineering (MPLS-...") |
m (Scipediacontent moved page Draft Content 889906168 to Lahoud et al 2005b) |
(No difference)
| |
Latest revision as of 20:24, 3 February 2021
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:
Document information
Published on 01/01/2005
Volume 2005, 2005
DOI: 10.1109/lanman.2005.1541532
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?