首页 | 官方网站   微博 | 高级检索  
     

面向时延与可靠性优化的服务功能链部署方法
引用本文:翟东,孟相如,康巧燕,胡航,韩晓阳.面向时延与可靠性优化的服务功能链部署方法[J].电子与信息学报,2020,42(10):2386-2393.
作者姓名:翟东  孟相如  康巧燕  胡航  韩晓阳
作者单位:1.空军工程大学研究生院 西安 7100772.空军工程大学信息与导航学院 西安 710077
基金项目:国家自然科学基金(61871313, 61901509),陕西省自然科学基金青年项目(2018JQ6042)
摘    要:针对5G网络高可靠性、低时延的服务需求,该文提出一种面向时延与可靠性优化的服务功能链(SFC)部署(DROSD)方法。在不预留冗余资源的情况下,首先通过功能互斥约束来确定SFC中相邻虚拟网络功能(VNF)是否可聚合;其次通过功能性约束、资源约束选择可聚合物理节点集合,实现负载均衡,提高SFC可靠性;然后通过跳数约束进行优化,进一步筛选可聚合物理节点集合以降低SFC的端到端时延;最后通过节点可用资源、节点度以及与原节点跳数指标进行降序排列,取最大值物理节点部署VNF。SFC的路由选择,采用K-最短路径算法。仿真实验表明,该文所提算法提高了请求接受率、长期平均收益开销比,增强了SFC可靠性,降低了端到端时延,减小了平均带宽开销。

关 键 词:网络功能虚拟化    服务功能链    虚拟网络功能部署    可靠性    时延
收稿时间:2020-01-06

Service Function Chain Deployment Method for Delay and Reliability Optimization
Dong ZHAI,Xiangru MENG,Qiaoyan KANG,Hang HU,Xiaoyang HAN.Service Function Chain Deployment Method for Delay and Reliability Optimization[J].Journal of Electronics & Information Technology,2020,42(10):2386-2393.
Authors:Dong ZHAI  Xiangru MENG  Qiaoyan KANG  Hang HU  Xiaoyang HAN
Affiliation:1.Graduate School, Aire Force Engineering University, Xi’an 710077, China2.Information and Navigation College, Aire Force Engineering University, Xi’an 710077, China
Abstract:For the high reliability and low delay service requirements of 5G network, a Delay and Reliability Optimization of Service Function Chain (SFC) Deployment (DROSD) method is proposed. Without reservation of redundant resources, firstly, the function mutually exclusive constraints are used to determine whether the adjacent Virtual Network Function (VNF) in SFC can be combined; Secondly, functional constraints and resource constraints are used to select combinatorial physical node set to achieve load balancing and improve the reliability of SFC; Thirdly, the end-to-end delay of SFC is reduced by hop number constraints, and finally the VNF is deployed by the physical node with the maximum value, which is arranged in descending order through the available resources, node degree and hops from the original node. The routing of SFC adopts K-shortest path algorithm. The simulation results show that the proposed algorithm improves the request acceptance rate and the long-term average ratio of revenue to cost, enhances the reliability of SFC, reduces the end-to-end delay, and reduces the average bandwidth cost.
Keywords:
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号