Near-Optimal Energy-Efficient Algorithm for Virtual Network Function Placement

Zhang, X; Xu, Z; Fan, L; Yu, S; Qu, Y

Near-Optimal Energy-Efficient Algorithm for Virtual Network Function Placement

Zhang, X Xu, Z Fan, L Yu, S

Qu, Y

Permalink

Publisher:: Institute of Electrical and Electronics Engineers (IEEE)
Publication Type:: Journal Article
Citation:: IEEE Transactions on Cloud Computing, 2021, 10, (1), pp. 1-1
Issue Date:: 2021-07-01

Closed Access

	Filename	Description	Size
	Near-Optimal_Energy-Efficient_Algorithm_for_Virtual_Network_Function_Placement.pdf	Published version	1.32 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	Zhang, X
dc.contributor.author	Xu, Z
dc.contributor.author	Fan, L
dc.contributor.author	Yu, S https://orcid.org/0000-0003-4485-6743
dc.contributor.author	Qu, Y
dc.date.accessioned	2023-04-05T02:03:17Z
dc.date.available	2023-04-05T02:03:17Z
dc.date.issued	2021-07-01
dc.identifier.citation	IEEE Transactions on Cloud Computing, 2021, 10, (1), pp. 1-1
dc.identifier.issn	2168-7161
dc.identifier.issn	2372-0018
dc.identifier.uri	http://hdl.handle.net/10453/169144
dc.description.abstract	To accommodate heterogeneous and sophisticated network services, Network Function Virtualization (NFV) is invented as a hopeful networking technology. The most distinct feature of NFV is that it separates network functions from physical hardware. In the NFV architecture, various types of Virtual Network Functions (VNFs) are placed on specific software-based middleboxes by telecom providers. Traffic traverses through a sequence of Virtual Network Functions (VNFs) in pre-defined order, which is named as Service Function Chain (SFC). However, how to effectively place VNFs at different locations and steer SFC requests while minimizing energy consumption is still an open problem. Accordingly, we investigate on the joint optimization of VNF placement and traffic steering for energy efficiency in telecom networks. We first present the power consumption model in NFV-enabled telecom networks, and then formulate the studied problem as an Integer Linear Programming (ILP) model. Since the problem is proved as NP-hard, we design a polynomial algorithm that can achieve near-optimal performances based on the Markov approximation technique. In addition, our algorithm can be extended to an online version to serve dynamic arriving SFC requests. The online algorithm achieves a near-optimal long-term averaged performance. Extensive simulation results show that compared with the benchmark algorithms, in the offline and online scenario, our algorithm can reduce up to 14.08 and 13.72 percent power consumption in telecom networks, respectively.
dc.language	English
dc.publisher	Institute of Electrical and Electronics Engineers (IEEE)
dc.relation.ispartof	IEEE Transactions on Cloud Computing
dc.relation.isbasedon	10.1109/tcc.2019.2947554
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0805 Distributed Computing, 0806 Information Systems
dc.title	Near-Optimal Energy-Efficient Algorithm for Virtual Network Function Placement
dc.type	Journal Article
utslib.citation.volume	10
utslib.for	0805 Distributed Computing
utslib.for	0806 Information Systems
pubs.organisational-group	/University of Technology Sydney
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 Computer Science
utslib.copyright.status	closed_access	*
pubs.consider-herdc	false
dc.date.updated	2023-04-05T02:03:10Z
pubs.issue	1
pubs.publication-status	Published
pubs.volume	10
utslib.citation.issue	1

Abstract:

To accommodate heterogeneous and sophisticated network services, Network Function Virtualization (NFV) is invented as a hopeful networking technology. The most distinct feature of NFV is that it separates network functions from physical hardware. In the NFV architecture, various types of Virtual Network Functions (VNFs) are placed on specific software-based middleboxes by telecom providers. Traffic traverses through a sequence of Virtual Network Functions (VNFs) in pre-defined order, which is named as Service Function Chain (SFC). However, how to effectively place VNFs at different locations and steer SFC requests while minimizing energy consumption is still an open problem. Accordingly, we investigate on the joint optimization of VNF placement and traffic steering for energy efficiency in telecom networks. We first present the power consumption model in NFV-enabled telecom networks, and then formulate the studied problem as an Integer Linear Programming (ILP) model. Since the problem is proved as NP-hard, we design a polynomial algorithm that can achieve near-optimal performances based on the Markov approximation technique. In addition, our algorithm can be extended to an online version to serve dynamic arriving SFC requests. The online algorithm achieves a near-optimal long-term averaged performance. Extensive simulation results show that compared with the benchmark algorithms, in the offline and online scenario, our algorithm can reduce up to 14.08 and 13.72 percent power consumption in telecom networks, respectively.

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

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