Joint optimization of Service Chain Graph Design and Mapping in NFV-enabled networks

He, Y; Zhang, X; Xia, Z; Liu, Y; Sood, K; Yu, S

Joint optimization of Service Chain Graph Design and Mapping in NFV-enabled networks

He, Y Zhang, X Xia, Z Liu, Y Sood, K Yu, S

Permalink

Publisher:: ELSEVIER
Publication Type:: Journal Article
Citation:: Computer Networks, 2022, 202
Issue Date:: 2022-01-15

Closed Access

	Filename	Description	Size
	Joint optimization of Service Chain Graph Design and Mapping in NFV-enabled networks.pdf	Published version	2.5 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	He, Y
dc.contributor.author	Zhang, X
dc.contributor.author	Xia, Z
dc.contributor.author	Liu, Y
dc.contributor.author	Sood, K
dc.contributor.author	Yu, S https://orcid.org/0000-0003-4485-6743
dc.date.accessioned	2023-04-06T01:30:09Z
dc.date.available	2023-04-06T01:30:09Z
dc.date.issued	2022-01-15
dc.identifier.citation	Computer Networks, 2022, 202
dc.identifier.issn	1389-1286
dc.identifier.issn	1872-7069
dc.identifier.uri	http://hdl.handle.net/10453/169240
dc.description.abstract	Network Function Virtualization (NFV) is an emerging approach to serve diverse demands of network services by decoupling network functions and dedicated network devices. Traffic needs to traverse through a sequence of software-based Virtual Network Functions (VNFs) in a preset order, which is named as Service Function Chain (SFC). Since network operators usually deploy the same type of VNFs in different locations in NFV-enabled networks. How to steer a SFC request to an appropriate path in substrate networks to meet service demands becomes an important issue, which is typically known as SFC mapping. However, the existing research works on SFC mapping often assume that service chain graphs are given in advance. They do not consider VNF interdependency and traffic volume change, which are both theoretically challenging for NFV Management and Orchestration (MANO) framework. To this end, we study the joint optimization of Service Chain Graph Design and Mapping (SCGDM) in NFV-enabled networks. Our objective is to minimize the maximum link load factor to improve the performance of network system. We first formulate the SCGDM problem as an Integer Linear Programming (ILP) model, and prove that it is an NP-hard problem by reduction from a classical Virtual Network Embedding (VNE) problem. Further, we develop an approximation algorithm using randomized rounding method and analyze the approximation performance. Extensive simulation results show that the proposed algorithm effectively reduce the maximum link load factor.
dc.language	English
dc.publisher	ELSEVIER
dc.relation.ispartof	Computer Networks
dc.relation.isbasedon	10.1016/j.comnet.2021.108626
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	08 Information and Computing Sciences, 09 Engineering, 10 Technology
dc.subject.classification	Networking & Telecommunications
dc.title	Joint optimization of Service Chain Graph Design and Mapping in NFV-enabled networks
dc.type	Journal Article
utslib.citation.volume	202
utslib.for	08 Information and Computing Sciences
utslib.for	09 Engineering
utslib.for	10 Technology
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	*
dc.date.updated	2023-04-06T01:30:08Z
pubs.publication-status	Published
pubs.volume	202

Abstract:

Network Function Virtualization (NFV) is an emerging approach to serve diverse demands of network services by decoupling network functions and dedicated network devices. Traffic needs to traverse through a sequence of software-based Virtual Network Functions (VNFs) in a preset order, which is named as Service Function Chain (SFC). Since network operators usually deploy the same type of VNFs in different locations in NFV-enabled networks. How to steer a SFC request to an appropriate path in substrate networks to meet service demands becomes an important issue, which is typically known as SFC mapping. However, the existing research works on SFC mapping often assume that service chain graphs are given in advance. They do not consider VNF interdependency and traffic volume change, which are both theoretically challenging for NFV Management and Orchestration (MANO) framework. To this end, we study the joint optimization of Service Chain Graph Design and Mapping (SCGDM) in NFV-enabled networks. Our objective is to minimize the maximum link load factor to improve the performance of network system. We first formulate the SCGDM problem as an Integer Linear Programming (ILP) model, and prove that it is an NP-hard problem by reduction from a classical Virtual Network Embedding (VNE) problem. Further, we develop an approximation algorithm using randomized rounding method and analyze the approximation performance. Extensive simulation results show that the proposed algorithm effectively reduce the maximum link load factor.

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

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