Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Aperta - TÜBİTAK Açı...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Aperta - TÜBİTAK Açık Arşivi
Other literature type . 2019
License: CC BY
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
International Journal of Digital & Analog Cabled Systems
Article . 2019 . Peer-reviewed
License: Wiley Online Library User Agreement
Data sources: Crossref
https://doi.org/10.1109/siu.20...
Article . 2017 . Peer-reviewed
Data sources: Crossref
DBLP
Article . 2025
Data sources: DBLP
DBLP
Conference object . 2017
Data sources: DBLP
versions View all 5 versions
addClaim

Energy efficient virtual network embedding for federated software‐defined networks

Authors: Mohamed Haji Dahir; Hadi Alizadeh; Didem Gözüpek;

Energy efficient virtual network embedding for federated software‐defined networks

Abstract

SummaryIn this paper, we focus on energy efficient virtual network embedding in federated (multidomain) software‐defined networks (SDNs). We first formulate an optimization problem as an integer linear program (ILP) that minimizes the energy consumption of the network links, while at the same time adhering to the bandwidth and CPU requirements of the virtual network requests. We then propose a polynomial‐time heuristic algorithm, which consists of three stages. In the first stage, the top SDN controller decides on whether to partition the virtual network request into smaller subrequests and give subrequests to multiple domains or give the enitre virtual network request to a single domain, while in the second stage, each SDN controller implements virtual network embedding in its own domain. Finally, in the third stage, the algorithm performs interdomain routing if partitioning decision had been made in the first stage. Our simulation results demonstrate that our proposed algorithm yields close performance to the solutions obtained by using the optimization software CPLEX that implements our ILP.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    10
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
10
Top 10%
Average
Average
Green