邱航,,
游伟,
季新生
国家数字交换系统工程技术研究中心 ??郑州 ??450002
基金项目:国家重点研发计划网络空间安全专项(2016YFB0801605)，国家自然科学基金创新群体项目(61521003)，国家自然科学基金(61801515)
详细信息
作者简介:汤红波：男，1968年生，教授、博师生导师，主要研究方向为移动通信网络、新型网络体系结构
邱航：男，1994年生，硕士生，研究方向为新一代移动通信技术、5G网络安全
游伟：男，1984年生，博士，讲师，研究方向为移动通信网络安全，新一代移动通信网络技术
季新生：男，1968年生，教授、博师生导师，主要研究方向为新一代移动通信技术、网络安全
通讯作者:邱航 hangsoon@foxmail.com
中图分类号:TN393.03计量
文章访问数:1888
HTML全文浏览量:892
PDF下载量:54
被引次数:0
出版历程
收稿日期:2019-01-07
修回日期:2019-04-22
网络出版日期:2019-05-24
刊出日期:2019-12-01
A Reliability-guarantee Method for Service Function Chain Deployment Based on Joint Backup
Hongbo TANG,Hang QIU,,
Wei YOU,
Xinsheng JI
National Digital Switching System Engineering and Technological R&D Center, Zhengzhou 450002, China
Funds:The National Key R & D Program Cyberspace Security Special (2016YFB0801605), The National Natural Science Foundation Innovative Groups Project of China (61521003), The National Natural Science Foundation of China (61801515)
摘要
摘要:在网络功能虚拟化(NFV)环境中，针对服务功能链(SFC)部署时的可靠性问题，该文提出对备份虚拟网络功能选择、备份实例放置和服务功能链部署的联合优化方法。首先，定义一个单位开销可靠性提高值的虚拟网络功能衡量标准，改进备份虚拟网络功能选择方法；其次，采用联合备份的方式调整相邻备份实例之间的放置策略，以降低带宽资源开销；最后，将整个服务功能链可靠性保障的部署问题构建成整数线性规划模型，并提出一种基于最短路径的启发式算法，克服整数线性规划求解的复杂性。仿真结果表明，该方法在优先满足网络服务可靠性需求的同时，优化资源配置，提高了请求接受率。
关键词:网络功能虚拟化(NFV)/
服务功能链(SFC)/
可靠性/
单位开销可靠性提高值/
整数线性规划
Abstract:In the Network Function Virtualization (NFV) environment, for the reliability problem of Service Function Chain (SFC) deployment, a joint optimization method is proposed for backup Virtual Network Function (VNF) selection, backup instance placement and service function chain deployment. Firstly, the method defines a virtual network function measurement standard named the unit cost reliability improvement value to improve the backup virtual network function selection method. Secondly, the joint backup mode is used to adjust the placement strategy between adjacent backup instances to reduce bandwidth resources overhead. Finally, the reliability-guarantee problem of the whole service function chain deployment is modeled as integer linear programming, and a heuristic algorithm based on the shortest path is proposed to overcome the complexity of integer linear programming. The simulation results show that the method optimizes resource allocation while prioritizing the network service reliability requirements, and improves the request acceptance rate.
Key words:Network Function Virtualization (NFV)/
Service Function Chaining (SFC)/
Reliability/
Unit cost improvement value/
Integer linear programming
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=6e58310d-08d5-4c34-8558-621affd9cd62
