A Method for Adaptive Resource Adjustment of Dynamic Service Function Chain

doi:10.1109/ACCESS.2018.2880251

CORC > 计算技术研究所 > 中国科学院计算技术研究所 > 中国科学院计算技术研究所期刊论文 > 英文

	A Method for Adaptive Resource Adjustment of Dynamic Service Function Chain
	Zhang, Hongqi 2; Guan, Hongtao 1; Wang, Yang 1; Liu, Yi 3,4
刊名	IEEE ACCESS
	2018
卷号	6 页码:69988-70004
关键词	Dynamic service function chain integer linear programming network function virtualization resource adjustment software defined networking
ISSN号	2169-3536
DOI	10.1109/ACCESS.2018.2880251
英文摘要	Service function chain (SFC) is widely exploited to provide heterogeneous network services, which refers to an ordered sequence of network functions that a given flow should traverse. However, its traditional implementation is inflexible and high-cost due to relying on proprietary hardware. Emerging technologies such as network function virtualization and software-defined networking are the two promising paradigms for improving the flexibility to implement SFC. A major challenge in this respect is the SFC resource allocation that deals with the efficient allocation of network resources to network functions and their connections belonging to SFC. Previous researches focused on heuristic algorithms for the SFC resource allocation assuming that the topology and the resource requirement of SFC do not change. In this paper, we remove this assumption and study how to adjust resource allocation scheme optimally when SFC changes, which is referred as dynamic SFC resource adjustment problem (DSFC-RAP). It is a challenging problem for various reasons, such as contradiction between reducing resource consumption and minimizing adjustment operation overhead. We first formulate the DSFC-RAP as an integer linear programming. Then, we propose a heuristic-based method to find the near-optimal solution with low computational complexity. Evaluation results demonstrate that our method allows network to accommodate more SFCs while incurring relative low network resource cost and adjustment operation overhead compared to other heuristics.
资助项目	National High Technology Research and Development Program of China (863 Program)[2015AA7116040] ; Zhengzhou Science and Technology Talents[131PLJRC644]
WOS研究方向	Computer Science ; Engineering ; Telecommunications
语种	英语
出版者	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
WOS记录号	WOS:000452956800001
内容类型	期刊论文
源URL	[http://119.78.100.204/handle/2XEOYT63/3506]
专题	中国科学院计算技术研究所期刊论文_英文
通讯作者	Liu, Yi
作者单位	1.Chinese Acad Sci, Inst Comp Technol, Beijing 100089, Peoples R China 2.Zhengzhou Informat Sci & Technol Inst, Zhengzhou 450000, Henan, Peoples R China 3.Zhengzhou Informat Sci & Technol Inst, Comp Sci & Technol, Zhengzhou 450000, Henan, Peoples R China 4.Zhengzhou Informat Sci & Technol Inst, Informat Engn, Zhengzhou 450000, Henan, Peoples R China
推荐引用方式 GB/T 7714	Zhang, Hongqi,Guan, Hongtao,Wang, Yang,et al. A Method for Adaptive Resource Adjustment of Dynamic Service Function Chain[J]. IEEE ACCESS,2018,6:69988-70004.
APA	Zhang, Hongqi,Guan, Hongtao,Wang, Yang,&Liu, Yi.(2018).A Method for Adaptive Resource Adjustment of Dynamic Service Function Chain.IEEE ACCESS,6,69988-70004.
MLA	Zhang, Hongqi,et al."A Method for Adaptive Resource Adjustment of Dynamic Service Function Chain".IEEE ACCESS 6(2018):69988-70004.