Multi-Criteria p-Cycle Network Design

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00538611
Contributor : Hamza Drid <>
Submitted on : Monday, November 22, 2010 - 11:29:32 PM
Last modification on : Friday, November 16, 2018 - 1:23:40 AM

Identifiers

  • HAL Id : hal-00538611, version 1

Citation

Hamza Drid, Bernard Cousin, Samer Lahoud, Miklos Molnar. Multi-Criteria p-Cycle Network Design. 33rd IEEE Conference on Local Computer Networks, Oct 2008, Montreal, Canada. pp.336-344. ⟨hal-00538611⟩

Share

Metrics

Record views

231