Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability
Maaloul, Rihab; Taktak, Raouia; Chaari, Lamia; Cousin, Bernard (2018), Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability, 25th International Conference on Telecommunications (ICT 2018), IEEE - Institute of Electrical and Electronics Engineers : Piscataway, NJ, p. 554-560. 10.1109/ICT.2018.8464840
Type
Communication / ConférenceExternal document link
https://hal.archives-ouvertes.fr/hal-01875381Date
2018Conference title
25th International Conference on Telecommunication (ICT 2018)Conference date
2018-07Conference city
Saint-MaloConference country
FranceBook title
25th International Conference on Telecommunications (ICT 2018)Publisher
IEEE - Institute of Electrical and Electronics Engineers
Published in
Piscataway, NJ
ISBN
978-1-5386-2321-3
Pages
554-560
Publication identifier
Metadata
Show full item recordAuthor(s)
Maaloul, RihabTaktak, Raouia
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Chaari, Lamia
Cousin, Bernard

Abstract (EN)
Carrier grade networks are in general over-dimensioned in order to protect against network resource failures and to handle probable traffic peaks. Such network design exhibits non-negligible energy waste. As well known, during network operation, the traffic load varies remarkably over day hours. Typically, a significant amount of energy saving can be achieved by turning off redundant and underutilized resources. Ensuring a sufficient level of reliability while taking into account energy saving objective is a very challenging task. In this paper, we study the multi-commodity reliable network design for carrier Ethernet networks. Each traffic demand is routed along one working path, and a corresponding backup path computed considering dedicated protection scheme. The primary and backup path must be node-disjoint. We also assume that the links of the carrier grade networks are made of multiple physical cables called bundles. We propose an exact method based on an Integer Linear Programming (ILP) formulation for the two node-disjoint paths with energy-aware routing (TNDP-EAR) problem. The studied problem is known to be NP-hard. In order to solve it efficiently, we propose a heuristic-based algorithm called GreenTNDP. Preliminary experimental results show the effectiveness of our algorithms to solve the problem.Subjects / Keywords
Energy-aware routing; Two disjoint paths; Carrier grade networks; Reliability; Network optimizationRelated items
Showing items related by title and author.
-
Maaloul, Rihab; Taktak, Raouia; Chaari, Lamia; Cousin, Bernard (2017) Article accepté pour publication ou publié
-
Mahjoub, Meriem; Diarrassouba, Ibrahima; Mahjoub, Ali Ridha; Taktak, Raouia (2017) Article accepté pour publication ou publié
-
Mahjoub, Ali Ridha; Kutucu, Hakan; Diarrassouba, Ibrahima (2013) Article accepté pour publication ou publié
-
Diarrassouba, Ibrahima; Mahjoub, Meriem; Mahjoub, Ali Ridha; Taktak, Raouia (2016) Article accepté pour publication ou publié
-
Ackooij, Wim van; D'Ambrosio, Claudia; Liberti, Leo; Taktak, Raouia; Thomopulos, Dimitri; Toubaline, Sónia (2018) Article accepté pour publication ou publié