Low-latency and Resource-efficient Service Function Chaining Orchestration in Network Function Virtualization

Gang Sun, Zhu Xu, Hongfang Yu, Xi Chen, Victor Chang, Athanasios V. Vasilakos

Research output: Contribution to journalArticle

30 Downloads (Pure)

Abstract

Recently, network function virtualization (NFV) has been proposed to solve the dilemma faced by traditional networks and to improve network performance through hardware and software decoupling. The deployment of the service function chain (SFC) is a key technology that affects the performance of virtual network function (VNF). The key issue in the deployment of SFCs is proposing effective algorithms to achieve efficient use of resources. In this paper, we propose a service function chain deployment optimization (SFCDO) algorithm based on a breadth-first search (BFS). The algorithm first uses a BFS based algorithm to find the shortest path between the source node and the destination node. Then, based on the shortest path, the path with the fewest hops is preferentially chosen to implement the SFC deployment. Finally, we compare the performances with the greedy and simulated annealing (G-SA) algorithm. The experiment results show that the proposed algorithm is optimized in terms of end-to-end delay and bandwidth resource consumption. In addition, we also consider the load rate of the nodes to achieve network load balancing.
Original languageEnglish
Pages (from-to)1-1
JournalIEEE Internet of Things Journal
DOIs
Publication statusPublished - 23 Aug 2019

Fingerprint

Network performance
Simulated annealing
Resource allocation
Network function virtualization
Hardware
Bandwidth
Experiments

Cite this

@article{9024f99125134af8b4de7f62ec619df0,
title = "Low-latency and Resource-efficient Service Function Chaining Orchestration in Network Function Virtualization",
abstract = "Recently, network function virtualization (NFV) has been proposed to solve the dilemma faced by traditional networks and to improve network performance through hardware and software decoupling. The deployment of the service function chain (SFC) is a key technology that affects the performance of virtual network function (VNF). The key issue in the deployment of SFCs is proposing effective algorithms to achieve efficient use of resources. In this paper, we propose a service function chain deployment optimization (SFCDO) algorithm based on a breadth-first search (BFS). The algorithm first uses a BFS based algorithm to find the shortest path between the source node and the destination node. Then, based on the shortest path, the path with the fewest hops is preferentially chosen to implement the SFC deployment. Finally, we compare the performances with the greedy and simulated annealing (G-SA) algorithm. The experiment results show that the proposed algorithm is optimized in terms of end-to-end delay and bandwidth resource consumption. In addition, we also consider the load rate of the nodes to achieve network load balancing.",
author = "Gang Sun and Zhu Xu and Hongfang Yu and Xi Chen and Victor Chang and Vasilakos, {Athanasios V.}",
year = "2019",
month = "8",
day = "23",
doi = "10.1109/jiot.2019.2937110",
language = "English",
pages = "1--1",
journal = "IEEE Internet of Things Journal",
issn = "2327-4662",
publisher = "Institute of Electrical and Electronics Engineers",

}

Low-latency and Resource-efficient Service Function Chaining Orchestration in Network Function Virtualization. / Sun, Gang; Xu, Zhu; Yu, Hongfang; Chen, Xi; Chang, Victor; Vasilakos, Athanasios V.

In: IEEE Internet of Things Journal, 23.08.2019, p. 1-1.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Low-latency and Resource-efficient Service Function Chaining Orchestration in Network Function Virtualization

AU - Sun, Gang

AU - Xu, Zhu

AU - Yu, Hongfang

AU - Chen, Xi

AU - Chang, Victor

AU - Vasilakos, Athanasios V.

PY - 2019/8/23

Y1 - 2019/8/23

N2 - Recently, network function virtualization (NFV) has been proposed to solve the dilemma faced by traditional networks and to improve network performance through hardware and software decoupling. The deployment of the service function chain (SFC) is a key technology that affects the performance of virtual network function (VNF). The key issue in the deployment of SFCs is proposing effective algorithms to achieve efficient use of resources. In this paper, we propose a service function chain deployment optimization (SFCDO) algorithm based on a breadth-first search (BFS). The algorithm first uses a BFS based algorithm to find the shortest path between the source node and the destination node. Then, based on the shortest path, the path with the fewest hops is preferentially chosen to implement the SFC deployment. Finally, we compare the performances with the greedy and simulated annealing (G-SA) algorithm. The experiment results show that the proposed algorithm is optimized in terms of end-to-end delay and bandwidth resource consumption. In addition, we also consider the load rate of the nodes to achieve network load balancing.

AB - Recently, network function virtualization (NFV) has been proposed to solve the dilemma faced by traditional networks and to improve network performance through hardware and software decoupling. The deployment of the service function chain (SFC) is a key technology that affects the performance of virtual network function (VNF). The key issue in the deployment of SFCs is proposing effective algorithms to achieve efficient use of resources. In this paper, we propose a service function chain deployment optimization (SFCDO) algorithm based on a breadth-first search (BFS). The algorithm first uses a BFS based algorithm to find the shortest path between the source node and the destination node. Then, based on the shortest path, the path with the fewest hops is preferentially chosen to implement the SFC deployment. Finally, we compare the performances with the greedy and simulated annealing (G-SA) algorithm. The experiment results show that the proposed algorithm is optimized in terms of end-to-end delay and bandwidth resource consumption. In addition, we also consider the load rate of the nodes to achieve network load balancing.

U2 - 10.1109/jiot.2019.2937110

DO - 10.1109/jiot.2019.2937110

M3 - Article

SP - 1

EP - 1

JO - IEEE Internet of Things Journal

JF - IEEE Internet of Things Journal

SN - 2327-4662

ER -