Novel constrained-path computation algorithm for failure recovery and CAC in GMPLS optical networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Novel constrained-path computation algorithm for failure recovery and CAC in GMPLS optical networks

Résumé

GMPLS protocol was designed in order to apply label-switching techniques to different network technologies, such as time division multiplexing (TDM), wavelength routing and packet switching networks. Resource reservations are performed all along label switched paths (LSP). This paper proposes a novel constraint-based routing (CBR) algorithm for GMPLS networks. Our solution includes path computation and resourcespsila assignment for both admission control and failure recovery mechanisms. Unlike other constraint-based routing protocols, our algorithm supports several classes of traffic with different failure recovery schemes. We investigated the performance of our algorithm through simulation works which are performed on a GMPLS optical network configured with the European reference core topology. Numerical results have shown that, compared to constrained shortest path first (CSPF) routing, our solution enhances the success probability of path setup and optimizes the global performance in terms of queuing delay and bit loss ratio
Fichier non déposé

Dates et versions

hal-01327398 , version 1 (06-06-2016)

Identifiants

Citer

Thaere Eido, Abdessalem Mribah, Tülin Atmaca. Novel constrained-path computation algorithm for failure recovery and CAC in GMPLS optical networks. ISCIS 2008 : 23rd International Symposium on Computer and Information Sciences, Oct 2009, Istanbul, Turkey. pp.1 - 6, ⟨10.1109/ISCIS.2008.4717858⟩. ⟨hal-01327398⟩
57 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More