删除或更新信息,请邮件至freekaoyan#163.com(#换成@)

基于重叠网络结构的服务功能链时空优化编排策略

本站小编 Free考研考试/2022-01-03

谷允捷,,
胡宇翔,
谢记超
国家数字交换系统工程技术研究中心 郑州 450002
基金项目:国家重点研发计划(2017YFB0803204),国家自然科学基金(61521003, 61872382),广东省重点领域研发计划(2018B010113001)

详细信息
作者简介:谷允捷:男,1994年生,博士生,研究方向为新型网络体系结构,网络功能虚拟化
胡宇翔:男,1982年生,副研究员,研究方向为新型网络体系结构,软件定义网络
谢记超:男,1995年生,硕士生,研究方向为网络安全、网络功能虚拟化与云安全
通讯作者:谷允捷 lizardwhite@163.com
中图分类号:TP393

计量

文章访问数:1655
HTML全文浏览量:831
PDF下载量:48
被引次数:0
出版历程

收稿日期:2019-03-13
修回日期:2019-06-18
网络出版日期:2019-06-25
刊出日期:2019-11-01

A Spatial and Temporal Optimal Method of Service Function Chain Orchestration Based on Overlay Network Structure

Yunjie GU,,
Yuxiang HU,
Jichao XIE
National Digital Switching System Engineering and Technological R&D Center, Zhengzhou 450002, China
Funds:The National Key Research and Development Project(2017YFB0803204), The National Natural Science Foundation of China (61521003, 61872382), The Research and Development Program in Key Areas of Guangdong Province (2018B010113001)


摘要
摘要:网络功能虚拟化(NFV)的引入大幅降低了互联网业务的运营成本。针对现有的服务功能链(SFC)编排方法无法在优化底层资源的同时保证业务时延性能的问题,该文提出一种基于重叠网络结构的SFC时空优化编排策略。在将计算、网络资源与细粒度时延约束纳入考虑的基础上,该策略通过建立重叠网络模型实现了计算与网络资源的分离,将构建SFC所需的资源开销与相关时延共同抽象化为重叠网络链路权重,从而使SFC编排问题转化为易于求解的最短路径问题。对于需要批量处理的SFC集合设计了基于重叠网络的模拟退火迭代优化编排算法(ONSA)。通过对比实验证明了该策略下编排方案的平均端到端时延、链路资源占用率与运营开销相对其他方案分别降低29.5%, 12.4%与15.2%,请求接受率提高22.3%,虚拟网络功能(VNF)负载均衡性能得到显著提升。
关键词:网络功能虚拟化/
时空优化/
重叠网络/
迭代优化
Abstract:With the introduction of Network Function Virtualization (NFV), the operating costs of operators can be greatly reduced. However, most existing Service Function Chain (SFC) orchestration researches can not optimize the resources utilization while guaranteeing the performance of service delay. A spatial and temporal optimal method of Service Function Chain (SFC) orchestration based on an overlay network structure is proposed. Based on the consideration of the restrictions such as computing resource, network resource and fine-grained end to end delay, this method separates the computing resource and network resource. The resources cost and related delay of SFC can be abstracted into the links weight of overlay network, which can help to convert the SFC orchestration problem into the shortest path problem that can be easily solved. As for the SFC requests set requiring batch processing, an Overlay Network based Simulated Annealing iterative optimal orchestration algorithm(ONSA) is designed. The simulation results demonstrate that the proposed orchestration scheme can reduce the end-to-end delay, the utilization ratio of link bandwidth resource and the operational expenditure by 29.5%, 12.4% and 15.2%, and the acceptance ratio of requests set can be improved by 22.3%. The performance of Virtual Network Function (VNF) load balancing can be significantly improved.
Key words:Network Function Virtualization (NFV)/
Spatial and temporal optimization/
Overlay network/
Iterative optimization



PDF全文下载地址:

https://jeit.ac.cn/article/exportPdf?id=0cbae114-9249-4513-97dc-eee0204c858b
相关话题/网络 优化 资源 方案 计算