Renewable Energy-Aware Joint Caching and Routing for Green Communication Networks

Abdallah Khreishah, Haythem Bany Salameh, Issa Khalil, Ammar Gharaibeh

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The Internet is one of the fastest increasing contributors to carbon emission. Content distribution as video on demand constitutes the majority of the Internet traffic. In order to reduce the Internet’s carbon footprint, we propose greener mechanisms for content delivery that utilize the use of renewable energy and content caching concept. If renewable energy is not enough to satisfy a given user’s demand, we use brown energy to satisfy the demand. Specifically, we consider the joint routing and caching problem with the objective of minimizing the brown energy usage while satisfying the users’ requests. We formulate the problem as a mixed integer-linear program (MILP) and prove that it is NP-hard. Accordingly, we present two relaxation techniques to find an efficient solution in a polynomial time (within 10% of the optimal). The first technique is based on relaxation and rounding. The other one is a near-optimal solution based on sequential fixing, where the binary variables are determined iteratively by solving a sequence of linear programs. Then, we develop a gradient-based distributed algorithm that can adapt to the changes in traffic and renewable energy conditions. Finally, we show that by utilizing network coding, the problem can be formulated using linear programming, which has polynomial-time complexity. Simulation results are provided, which verify the effectiveness of our optimization framework and demonstrate the significant energy saving achieved (up to 90%) over the nonenergy-aware shortest path-routing method.

Original languageEnglish
JournalIEEE Systems Journal
DOIs
Publication statusAccepted/In press - 3 Mar 2016

Fingerprint

Telecommunication networks
Internet
Polynomials
Carbon footprint
Video on demand
Network coding
Parallel algorithms
Linear programming
Energy conservation
Carbon

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Renewable Energy-Aware Joint Caching and Routing for Green Communication Networks. / Khreishah, Abdallah; Bany Salameh, Haythem; Khalil, Issa; Gharaibeh, Ammar.

In: IEEE Systems Journal, 03.03.2016.

Research output: Contribution to journalArticle

Khreishah, Abdallah ; Bany Salameh, Haythem ; Khalil, Issa ; Gharaibeh, Ammar. / Renewable Energy-Aware Joint Caching and Routing for Green Communication Networks. In: IEEE Systems Journal. 2016.
@article{69891e44300f4528b2dc83e89c764584,
title = "Renewable Energy-Aware Joint Caching and Routing for Green Communication Networks",
abstract = "The Internet is one of the fastest increasing contributors to carbon emission. Content distribution as video on demand constitutes the majority of the Internet traffic. In order to reduce the Internet’s carbon footprint, we propose greener mechanisms for content delivery that utilize the use of renewable energy and content caching concept. If renewable energy is not enough to satisfy a given user’s demand, we use brown energy to satisfy the demand. Specifically, we consider the joint routing and caching problem with the objective of minimizing the brown energy usage while satisfying the users’ requests. We formulate the problem as a mixed integer-linear program (MILP) and prove that it is NP-hard. Accordingly, we present two relaxation techniques to find an efficient solution in a polynomial time (within 10{\%} of the optimal). The first technique is based on relaxation and rounding. The other one is a near-optimal solution based on sequential fixing, where the binary variables are determined iteratively by solving a sequence of linear programs. Then, we develop a gradient-based distributed algorithm that can adapt to the changes in traffic and renewable energy conditions. Finally, we show that by utilizing network coding, the problem can be formulated using linear programming, which has polynomial-time complexity. Simulation results are provided, which verify the effectiveness of our optimization framework and demonstrate the significant energy saving achieved (up to 90{\%}) over the nonenergy-aware shortest path-routing method.",
author = "Abdallah Khreishah and {Bany Salameh}, Haythem and Issa Khalil and Ammar Gharaibeh",
year = "2016",
month = "3",
day = "3",
doi = "10.1109/JSYST.2016.2530695",
language = "English",
journal = "IEEE Systems Journal",
issn = "1932-8184",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Renewable Energy-Aware Joint Caching and Routing for Green Communication Networks

AU - Khreishah, Abdallah

AU - Bany Salameh, Haythem

AU - Khalil, Issa

AU - Gharaibeh, Ammar

PY - 2016/3/3

Y1 - 2016/3/3

N2 - The Internet is one of the fastest increasing contributors to carbon emission. Content distribution as video on demand constitutes the majority of the Internet traffic. In order to reduce the Internet’s carbon footprint, we propose greener mechanisms for content delivery that utilize the use of renewable energy and content caching concept. If renewable energy is not enough to satisfy a given user’s demand, we use brown energy to satisfy the demand. Specifically, we consider the joint routing and caching problem with the objective of minimizing the brown energy usage while satisfying the users’ requests. We formulate the problem as a mixed integer-linear program (MILP) and prove that it is NP-hard. Accordingly, we present two relaxation techniques to find an efficient solution in a polynomial time (within 10% of the optimal). The first technique is based on relaxation and rounding. The other one is a near-optimal solution based on sequential fixing, where the binary variables are determined iteratively by solving a sequence of linear programs. Then, we develop a gradient-based distributed algorithm that can adapt to the changes in traffic and renewable energy conditions. Finally, we show that by utilizing network coding, the problem can be formulated using linear programming, which has polynomial-time complexity. Simulation results are provided, which verify the effectiveness of our optimization framework and demonstrate the significant energy saving achieved (up to 90%) over the nonenergy-aware shortest path-routing method.

AB - The Internet is one of the fastest increasing contributors to carbon emission. Content distribution as video on demand constitutes the majority of the Internet traffic. In order to reduce the Internet’s carbon footprint, we propose greener mechanisms for content delivery that utilize the use of renewable energy and content caching concept. If renewable energy is not enough to satisfy a given user’s demand, we use brown energy to satisfy the demand. Specifically, we consider the joint routing and caching problem with the objective of minimizing the brown energy usage while satisfying the users’ requests. We formulate the problem as a mixed integer-linear program (MILP) and prove that it is NP-hard. Accordingly, we present two relaxation techniques to find an efficient solution in a polynomial time (within 10% of the optimal). The first technique is based on relaxation and rounding. The other one is a near-optimal solution based on sequential fixing, where the binary variables are determined iteratively by solving a sequence of linear programs. Then, we develop a gradient-based distributed algorithm that can adapt to the changes in traffic and renewable energy conditions. Finally, we show that by utilizing network coding, the problem can be formulated using linear programming, which has polynomial-time complexity. Simulation results are provided, which verify the effectiveness of our optimization framework and demonstrate the significant energy saving achieved (up to 90%) over the nonenergy-aware shortest path-routing method.

UR - http://www.scopus.com/inward/record.url?scp=84959924131&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959924131&partnerID=8YFLogxK

U2 - 10.1109/JSYST.2016.2530695

DO - 10.1109/JSYST.2016.2530695

M3 - Article

AN - SCOPUS:84959924131

JO - IEEE Systems Journal

JF - IEEE Systems Journal

SN - 1932-8184

ER -