Multi-criteria p-cycle network design - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Multi-criteria p-cycle network design

Résumé

The major challenge of p-cycle network design resides in finding an optimal set of p-cycles protecting the network for a given working capacity. Existing solutions (exact and heuristic approaches), for solving the problem, find the set of p-cycles protecting the network through two steps: one step for generating candidate p-cycles and a second step for selecting the efficient ones. In this paper, we present a novel heuristic approach, which computes an efficient set of p-cycles protecting the network in one step. Our heuristic approach takes into consideration two different criteria: the redundancy and the number of p-cycles involved in the solution. Simulation study shows that our approach necessitates a lower redundancy and fewer p-cycles to protect the network compared to state-of-the-art approaches.
Fichier principal
Vignette du fichier
LCN 2008.DRID.pdf (128.86 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01184118 , version 1 (12-08-2015)

Identifiants

Citer

Hamza Drid, Bernard Cousin, Samer Lahoud, Miklos Molnar. Multi-criteria p-cycle network design. 33rd IEEE Conference on Local Computer Networks (LCN 2008), Oct 2008, Montréal, Canada. pp.361 - 366, ⟨10.1109/LCN.2008.4664191⟩. ⟨hal-01184118⟩
294 Consultations
95 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More