A Hybrid Virtual Network Function Placement Strategy for Maximizing the Profit of Network Service Deployment Over Time-Varying Workloads

The emergence of network function virtualization (NFV) has revolutionized the infrastructure and service management of network architecture. It allows network operators to reduce costs and improve the agility of network service deployment. But finding the best VNF placement is a well-known NP-comple...

Full description

Bibliographic Details
Main Authors: Chi-Chen Yang, Satyajit Padhy, Jerry Chou
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9474486/
_version_ 1798003327050448896
author Chi-Chen Yang
Satyajit Padhy
Jerry Chou
author_facet Chi-Chen Yang
Satyajit Padhy
Jerry Chou
author_sort Chi-Chen Yang
collection DOAJ
description The emergence of network function virtualization (NFV) has revolutionized the infrastructure and service management of network architecture. It allows network operators to reduce costs and improve the agility of network service deployment. But finding the best VNF placement is a well-known NP-complete problem. Hence, many previous studies either formulate the problem as an Integer Linear Programming (ILP) Problem or propose greedy algorithms. However, solving ILP is time-consuming, while greedy algorithms could be far from optimal solutions. As a result, neither ILP nor greedy can make quick and accurate placement decisions for dynamic traffic workloads. Therefore, we propose a hybrid method that uses less time to maximize the overall profit of network service deployment. Our evaluations based on real backbone network traffic and topology show that our hybrid approach can achieve up to 36% profit improvement compared to a pure greedy approach, while achieving x30 times computation time speedup over a pure ILP approach.
first_indexed 2024-04-11T12:05:53Z
format Article
id doaj.art-1e34e835b26f49fdaf620ffa3292cff1
institution Directory Open Access Journal
issn 2169-3536
language English
last_indexed 2024-04-11T12:05:53Z
publishDate 2021-01-01
publisher IEEE
record_format Article
series IEEE Access
spelling doaj.art-1e34e835b26f49fdaf620ffa3292cff12022-12-22T04:24:43ZengIEEEIEEE Access2169-35362021-01-019999839999410.1109/ACCESS.2021.30946649474486A Hybrid Virtual Network Function Placement Strategy for Maximizing the Profit of Network Service Deployment Over Time-Varying WorkloadsChi-Chen Yang0Satyajit Padhy1https://orcid.org/0000-0002-0251-2750Jerry Chou2https://orcid.org/0000-0001-7851-1140Department of Computer Science, National Tsing Hua University, Hsinchu, TaiwanInstitute of Information System and Applications, National Tsing Hua University, Hsinchu, TaiwanDepartment of Computer Science, National Tsing Hua University, Hsinchu, TaiwanThe emergence of network function virtualization (NFV) has revolutionized the infrastructure and service management of network architecture. It allows network operators to reduce costs and improve the agility of network service deployment. But finding the best VNF placement is a well-known NP-complete problem. Hence, many previous studies either formulate the problem as an Integer Linear Programming (ILP) Problem or propose greedy algorithms. However, solving ILP is time-consuming, while greedy algorithms could be far from optimal solutions. As a result, neither ILP nor greedy can make quick and accurate placement decisions for dynamic traffic workloads. Therefore, we propose a hybrid method that uses less time to maximize the overall profit of network service deployment. Our evaluations based on real backbone network traffic and topology show that our hybrid approach can achieve up to 36% profit improvement compared to a pure greedy approach, while achieving x30 times computation time speedup over a pure ILP approach.https://ieeexplore.ieee.org/document/9474486/Virtual network functionservice function chaintime-varying workloadplacement optimizationinteger linear programming
spellingShingle Chi-Chen Yang
Satyajit Padhy
Jerry Chou
A Hybrid Virtual Network Function Placement Strategy for Maximizing the Profit of Network Service Deployment Over Time-Varying Workloads
IEEE Access
Virtual network function
service function chain
time-varying workload
placement optimization
integer linear programming
title A Hybrid Virtual Network Function Placement Strategy for Maximizing the Profit of Network Service Deployment Over Time-Varying Workloads
title_full A Hybrid Virtual Network Function Placement Strategy for Maximizing the Profit of Network Service Deployment Over Time-Varying Workloads
title_fullStr A Hybrid Virtual Network Function Placement Strategy for Maximizing the Profit of Network Service Deployment Over Time-Varying Workloads
title_full_unstemmed A Hybrid Virtual Network Function Placement Strategy for Maximizing the Profit of Network Service Deployment Over Time-Varying Workloads
title_short A Hybrid Virtual Network Function Placement Strategy for Maximizing the Profit of Network Service Deployment Over Time-Varying Workloads
title_sort hybrid virtual network function placement strategy for maximizing the profit of network service deployment over time varying workloads
topic Virtual network function
service function chain
time-varying workload
placement optimization
integer linear programming
url https://ieeexplore.ieee.org/document/9474486/
work_keys_str_mv AT chichenyang ahybridvirtualnetworkfunctionplacementstrategyformaximizingtheprofitofnetworkservicedeploymentovertimevaryingworkloads
AT satyajitpadhy ahybridvirtualnetworkfunctionplacementstrategyformaximizingtheprofitofnetworkservicedeploymentovertimevaryingworkloads
AT jerrychou ahybridvirtualnetworkfunctionplacementstrategyformaximizingtheprofitofnetworkservicedeploymentovertimevaryingworkloads
AT chichenyang hybridvirtualnetworkfunctionplacementstrategyformaximizingtheprofitofnetworkservicedeploymentovertimevaryingworkloads
AT satyajitpadhy hybridvirtualnetworkfunctionplacementstrategyformaximizingtheprofitofnetworkservicedeploymentovertimevaryingworkloads
AT jerrychou hybridvirtualnetworkfunctionplacementstrategyformaximizingtheprofitofnetworkservicedeploymentovertimevaryingworkloads