• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - No thumbnail

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érence
External document link
https://hal.archives-ouvertes.fr/hal-01875381
Date
2018
Conference title
25th International Conference on Telecommunication (ICT 2018)
Conference date
2018-07
Conference city
Saint-Malo
Conference country
France
Book 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
10.1109/ICT.2018.8464840
Metadata
Show full item record
Author(s)
Maaloul, Rihab

Taktak, Raouia
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Chaari, Lamia

Cousin, Bernard cc
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 optimization

Related items

Showing items related by title and author.

  • Thumbnail
    Energy-Aware Routing in Carrier-Grade Ethernet using SDN Approach 
    Maaloul, Rihab; Taktak, Raouia; Chaari, Lamia; Cousin, Bernard (2017) Article accepté pour publication ou publié
  • Thumbnail
    The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut 
    Mahjoub, Meriem; Diarrassouba, Ibrahima; Mahjoub, Ali Ridha; Taktak, Raouia (2017) Article accepté pour publication ou publié
  • Thumbnail
    Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra 
    Mahjoub, Ali Ridha; Kutucu, Hakan; Diarrassouba, Ibrahima (2013) Article accepté pour publication ou publié
  • Thumbnail
    The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut 
    Diarrassouba, Ibrahima; Mahjoub, Meriem; Mahjoub, Ali Ridha; Taktak, Raouia (2016) Article accepté pour publication ou publié
  • Thumbnail
    Shortest Path Problem variants for the Hydro Unit Commitment Problem 
    Ackooij, Wim van; D'Ambrosio, Claudia; Liberti, Leo; Taktak, Raouia; Thomopulos, Dimitri; Toubaline, Sónia (2018) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo