Energy-Aware Service Function Chaining Embedding in NFV Networks

Network function virtualization (NFV) is a new networking paradigm based on decoupling network functions from dedicated hardware, so these network functions can be run as pieces of software on general-purpose computation servers, which are called virtual network functions. In addition to guarantee t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on services computing Ročník 16; číslo 2; s. 1158 - 1171
Hlavní autoři: Lin, Rongping, He, Liu, Luo, Shan, Zukerman, Moshe
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.03.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Chaining
Computation
Costs
Decoupling
Embedding
Energy consumption
Energy costs
Energy management
energy-aware
Heuristic
Heuristic algorithms
Heuristic methods
Integer programming
Linear programming
Mathematical analysis
Network function virtualization
Polynomials
Resource allocation
Resource management
Servers
service function chaining embedding
Switches
Virtual networks
ISSN:1939-1374, 2372-0204
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Network function virtualization (NFV) is a new networking paradigm based on decoupling network functions from dedicated hardware, so these network functions can be run as pieces of software on general-purpose computation servers, which are called virtual network functions. In addition to guarantee the service qualities provided by NFV networks comparable to those provided by traditional telecommunication networks, energy consumption becomes one of the challenges faced by NFV. This is due to a large number of general computation servers that consume a significant amount of energy. We address here the problem of how to provide an energy-aware service function chaining (SFC) embedding in NFV networks with a hierarchical resource allocation, where an SFC has a set of virtual network functions to be executed in a specific sequential order providing a specific network service. Assuming a dynamic traffic scenario, we introduce for this new problem an integer linear programming (ILP) and three polynomial heuristic algorithms for resource allocation. All three heuristic algorithms achieve energy savings by shutting down idle devices and balance the tradeoff between energy cost and SFC request acceptance ratio. Numerical results demonstrate the quality of the proposed heuristic algorithms in terms of acceptance ratio by comparing them with the ILP method and a method extended from an exiting algorithm despite the fact that they save energy.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1939-1374
2372-0204
DOI:10.1109/TSC.2022.3162328