• 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

Energy-Aware Routing in Carrier-Grade Ethernet using SDN Approach

Maaloul, Rihab; Taktak, Raouia; Chaari, Lamia; Cousin, Bernard (2017), Energy-Aware Routing in Carrier-Grade Ethernet using SDN Approach, IEEE Transactions on Green Communications and Networking, 2, 3, p. 844-858. 10.1109/TGCN.2018.2832658

Type
Article accepté pour publication ou publié
External document link
https://hal.archives-ouvertes.fr/hal-01858703
Date
2017
Journal name
IEEE Transactions on Green Communications and Networking
Volume
2
Number
3
Pages
844-858
Publication identifier
10.1109/TGCN.2018.2832658
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)
Soft-defined networking (SDN) is a new approach that enables operators to easily manage all the network elements. In this paper, we address the problem of energy-aware routing in SDN-based carrier-grade Ethernet networks. Our approach is based on turning off network nodes and links to reduce energy consumption, while respecting the rule space capacity for each Openflow switch, and maintaining an allowable maximum link utilization. The problem of identifying the optimal set of network elements to be turned off is NP-hard. We first present an exact model based on an integer linear programming formulation for the problem. Then, we describe a set of first-fit heuristic algorithms suitable for large-sized networks. The exact and heuristic approaches are tested on SNDlib-based instances. Experimentations show the efficiency of both exact and heuristic methods for different network topologies. In particular, our heuristic algorithms are able to achieve a good balance between energy consumption, resource utilization, and network performance.
Subjects / Keywords
Routing Optimization; Energy-Aware Routing; Carrier-Grade Ethernet; Software-Defined Networking (SDN)

Related items

Showing items related by title and author.

  • Thumbnail
    Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability 
    Maaloul, Rihab; Taktak, Raouia; Chaari, Lamia; Cousin, Bernard (2018) Communication / Conférence
  • Thumbnail
    Survavibility in Multilayer Networks : models and Polyhedra 
    Taktak, Raouia (2013-07) Thèse
  • Thumbnail
    The Impact of Energy Costs on Industrial Performance: Identifying Price and Quantity Effects in the Aluminum Industry Using a Data Envelopment Analysis Approach 
    Kpondjo, Nadia; Lantz, Frédéric; Creti, Anna; Pham Van Cang, Christian (2020-02) Article accepté pour publication ou publié
  • Thumbnail
    The Multiple Steiner TSP with order constraints: complexity and optimization algorithms 
    Gabrel, Virginie; Mahjoub, Ali Ridha; Taktak, Raouia; Uchoa, Eduardo (2020) 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