FATE: A Polynomial Time Framework for Flow Allocation in MPLS-TE Networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

FATE: A Polynomial Time Framework for Flow Allocation in MPLS-TE Networks

Résumé

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.
Fichier principal
Vignette du fichier
LANMAN05.pdf (135.01 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02368183 , version 1 (18-11-2019)

Identifiants

  • HAL Id : hal-02368183 , version 1

Citer

Samer Lahoud, Géraldine Texier, Laurent Toutain. FATE: A Polynomial Time Framework for Flow Allocation in MPLS-TE Networks. LANMAN 2005 : 14th IEEE Workshop on Local and Metropolitan Area Networks, Sep 2005, Crète, Greece. ⟨hal-02368183⟩
20 Consultations
60 Téléchargements

Partager

Gmail Facebook X LinkedIn More