Low-Latency and Resource-Efficient Service Function Chaining Orchestration in Network Function Virtualization

Sun, G; Xu, Z; Yu, H; Chen, X; Chang, V; Vasilakos, AV

Low-Latency and Resource-Efficient Service Function Chaining Orchestration in Network Function Virtualization

Sun, G Xu, Z Yu, H Chen, X Chang, V Vasilakos, AV

Permalink

Publisher:: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Publication Type:: Journal Article
Citation:: IEEE Internet of Things Journal, 2020, 7, (7), pp. 5760-5772
Issue Date:: 2020-07-01

Closed Access

	Filename	Description	Size
	08811504.pdf	Published version	1.69 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Sun, G
dc.contributor.author	Xu, Z
dc.contributor.author	Yu, H
dc.contributor.author	Chen, X
dc.contributor.author	Chang, V
dc.contributor.author	Vasilakos, AV
dc.date.accessioned	2021-02-26T22:50:55Z
dc.date.available	2021-02-26T22:50:55Z
dc.date.issued	2020-07-01
dc.identifier.citation	IEEE Internet of Things Journal, 2020, 7, (7), pp. 5760-5772
dc.identifier.issn	2327-4662
dc.identifier.issn	2327-4662
dc.identifier.uri	http://hdl.handle.net/10453/146507
dc.description.abstract	© 2014 IEEE. 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 article, we propose an SFC 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.
dc.language	English
dc.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
dc.relation.ispartof	IEEE Internet of Things Journal
dc.relation.isbasedon	10.1109/JIOT.2019.2937110
dc.rights	© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0805 Distributed Computing, 1005 Communications Technologies
dc.title	Low-Latency and Resource-Efficient Service Function Chaining Orchestration in Network Function Virtualization
dc.type	Journal Article
utslib.citation.volume	7
utslib.for	0805 Distributed Computing
utslib.for	1005 Communications Technologies
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	closed_access	*
dc.date.updated	2021-02-26T22:50:53Z
pubs.issue	7
pubs.publication-status	Published
pubs.volume	7
utslib.citation.issue	7

Abstract:

© 2014 IEEE. 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 article, we propose an SFC 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/146507