Request Reliability Augmentation with Service Function Chain Requirements in Mobile Edge Computing

Liang, W; Ma, Y; Xu, W; Xu, Z; Jia, X; Zhou, W

Request Reliability Augmentation with Service Function Chain Requirements in Mobile Edge Computing

Liang, W Ma, Y Xu, W Xu, Z Jia, X Zhou, W

Permalink

Publisher:: Institute of Electrical and Electronics Engineers (IEEE)
Publication Type:: Journal Article
Citation:: IEEE Transactions on Mobile Computing, 2022, 21, (12), pp. 4541-4554
Issue Date:: 2022-01-01

Closed Access

	Filename	Description	Size
	Request_Reliability_Augmentation_With_Service_Function_Chain_Requirements_in_Mobile_Edge_Computing.pdf	Published version	807.88 kB	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	Liang, W
dc.contributor.author	Ma, Y
dc.contributor.author	Xu, W
dc.contributor.author	Xu, Z
dc.contributor.author	Jia, X
dc.contributor.author	Zhou, W https://orcid.org/0000-0002-1680-2521
dc.date.accessioned	2023-04-05T03:15:47Z
dc.date.available	2023-04-05T03:15:47Z
dc.date.issued	2022-01-01
dc.identifier.citation	IEEE Transactions on Mobile Computing, 2022, 21, (12), pp. 4541-4554
dc.identifier.issn	1536-1233
dc.identifier.issn	1558-0660
dc.identifier.uri	http://hdl.handle.net/10453/169156
dc.description.abstract	In this paper, we study a novel service reliability augmentation problem in an Edge Computing network, where mobile users request network services with a service function chain (SFC) and reliability expectation requirements. To enhance the service reliability of user requests, it is a common practice to make use of redundant network function (VNF) instance placement in case their primary VNF instances fail. To this end, we first formulate a novel service reliability augmentation problem for each admitted request and show the NP-hardness of the problem. We then provide an admission framework of user requests by placing primary VNF instances of network functions in the SFC to different cloudlets, and then develop a randomized algorithm with a good approximation ratio and high probability for the service reliability augmentation problem, at the expense of moderate resource constraint violations. We also devise a deterministic heuristic for the problem without any resource violation. We thirdly extend the proposed algorithm for a single request to the service reliability augmentation problem for a set of requests. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising and superior to their analytical counterparts.
dc.language	en
dc.publisher	Institute of Electrical and Electronics Engineers (IEEE)
dc.relation.ispartof	IEEE Transactions on Mobile Computing
dc.relation.isbasedon	10.1109/TMC.2021.3081681
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0805 Distributed Computing, 0906 Electrical and Electronic Engineering, 1005 Communications Technologies
dc.subject.classification	Networking & Telecommunications
dc.title	Request Reliability Augmentation with Service Function Chain Requirements in Mobile Edge Computing
dc.type	Journal Article
utslib.citation.volume	21
utslib.for	0805 Distributed Computing
utslib.for	0906 Electrical and Electronic Engineering
utslib.for	1005 Communications Technologies
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-05T03:15:45Z
pubs.issue	12
pubs.publication-status	Published
pubs.volume	21
utslib.citation.issue	12

Abstract:

In this paper, we study a novel service reliability augmentation problem in an Edge Computing network, where mobile users request network services with a service function chain (SFC) and reliability expectation requirements. To enhance the service reliability of user requests, it is a common practice to make use of redundant network function (VNF) instance placement in case their primary VNF instances fail. To this end, we first formulate a novel service reliability augmentation problem for each admitted request and show the NP-hardness of the problem. We then provide an admission framework of user requests by placing primary VNF instances of network functions in the SFC to different cloudlets, and then develop a randomized algorithm with a good approximation ratio and high probability for the service reliability augmentation problem, at the expense of moderate resource constraint violations. We also devise a deterministic heuristic for the problem without any resource violation. We thirdly extend the proposed algorithm for a single request to the service reliability augmentation problem for a set of requests. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising and superior to their analytical counterparts.

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

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