Cover Image

Optimizing Service Function Chaining Migration With Explicit Dynamic Path

Network Function Virtualization (NFV) can support customized on- demand network services with flexibility and cost-efficiency. Virtual Network Function (VNF) instances need to be scaled out, scaled in, and reallocated across the NFV infrastructure (NFVI) to avoid a violation of service agreements wh...

Full description

Saved in:
Bibliographic Details
Main Author: Pham, Minh Tuan
Format: Bài trích
Language:English
Published: IEEE Access 2022
Subjects:
Heuristic algorithms
Routing
Online Access:https://ieeexplore.ieee.org/document/9709333
https://dlib.phenikaa-uni.edu.vn/handle/PNK/5766
https://doi.org/10.1109/ACCESS.2022.3150352
Tags: Add Tag
No Tags, Be the first to tag this record!
id oai:localhost:PNK-5766
record_format dspace
spelling oai:localhost:PNK-57662022-08-17T05:54:54Z Optimizing Service Function Chaining Migration With Explicit Dynamic Path Pham, Minh Tuan Heuristic algorithms Routing Network Function Virtualization (NFV) can support customized on- demand network services with flexibility and cost-efficiency. Virtual Network Function (VNF) instances need to be scaled out, scaled in, and reallocated across the NFV infrastructure (NFVI) to avoid a violation of service agreements when the demand traffic changes. However, selecting the new placement of VNFs for migrating a service function chain (SFC) is an issue of efficient NFV control. We propose two novel integer linear programming (ILP) models and two approximation algorithms for SFC placement and migration to maximize the cost-efficiency of an NFV network regarding the changes of service demands and dynamic routing. The ILP models allow us to obtain the optimal solutions of SFC placement and migration with explicit dynamic paths. The approximation migration results provided by our proposed heuristic and reinforcement learning algorithms are close to the optimal solution. Evaluation results carried out with real datasets and synthetic network topologies provide a helpful suggestion of a migration strategy for an NFV service provider to optimize the operating cost of an NFV network in the long term 2022-05-05T07:26:22Z 2022-05-05T07:26:22Z 2022 Bài trích https://ieeexplore.ieee.org/document/9709333 https://dlib.phenikaa-uni.edu.vn/handle/PNK/5766 https://doi.org/10.1109/ACCESS.2022.3150352 en IEEE Access
institution Digital Phenikaa
collection Digital Phenikaa
language English
topic Heuristic algorithms
Routing
spellingShingle Heuristic algorithms
Routing
Pham, Minh Tuan
Optimizing Service Function Chaining Migration With Explicit Dynamic Path
description Network Function Virtualization (NFV) can support customized on- demand network services with flexibility and cost-efficiency. Virtual Network Function (VNF) instances need to be scaled out, scaled in, and reallocated across the NFV infrastructure (NFVI) to avoid a violation of service agreements when the demand traffic changes. However, selecting the new placement of VNFs for migrating a service function chain (SFC) is an issue of efficient NFV control. We propose two novel integer linear programming (ILP) models and two approximation algorithms for SFC placement and migration to maximize the cost-efficiency of an NFV network regarding the changes of service demands and dynamic routing. The ILP models allow us to obtain the optimal solutions of SFC placement and migration with explicit dynamic paths. The approximation migration results provided by our proposed heuristic and reinforcement learning algorithms are close to the optimal solution. Evaluation results carried out with real datasets and synthetic network topologies provide a helpful suggestion of a migration strategy for an NFV service provider to optimize the operating cost of an NFV network in the long term
format Bài trích
author Pham, Minh Tuan
author_facet Pham, Minh Tuan
author_sort Pham, Minh Tuan
title Optimizing Service Function Chaining Migration With Explicit Dynamic Path
title_short Optimizing Service Function Chaining Migration With Explicit Dynamic Path
title_full Optimizing Service Function Chaining Migration With Explicit Dynamic Path
title_fullStr Optimizing Service Function Chaining Migration With Explicit Dynamic Path
title_full_unstemmed Optimizing Service Function Chaining Migration With Explicit Dynamic Path
title_sort optimizing service function chaining migration with explicit dynamic path
publisher IEEE Access
publishDate 2022
url https://ieeexplore.ieee.org/document/9709333
https://dlib.phenikaa-uni.edu.vn/handle/PNK/5766
https://doi.org/10.1109/ACCESS.2022.3150352
_version_ 1751856281988104192
score 8.891787

Similar Items