首页 | 本学科首页   官方微博 | 高级检索  
     

一种面向边缘环境的多实例服务链在线部署算法
引用本文:宋浒,甘让兴,夏飞,邹昊东. 一种面向边缘环境的多实例服务链在线部署算法[J]. 计算机工程与科学, 2021, 43(2): 218-227. DOI: 10.3969/j.issn.1007-130X.2021.02.005
作者姓名:宋浒  甘让兴  夏飞  邹昊东
作者单位:(1.南京大学计算机软件新技术国家重点实验室,江苏 南京 210023;2.国网江苏省电力有限公司信通分公司,江苏 南京 210023)
摘    要:边缘设备的资源有限性促使部署边缘服务需要深入理解网络功能的资源消耗情况.通过无线路由器上容器化网络功能部署实验得出,除了处理业务流的计算开销外,网络功能实例间的通信也会消耗大量CPU资源.基于该发现,考虑在近距离和相对低负载的对等边缘设备上分布式地部署网络功能实例,在满足时延约束的条件下均衡流量,从而最小化边缘设备负载...

关 键 词:边缘计算  网络功能虚拟化  服务链部署
收稿时间:2020-05-10
修稿时间:2020-07-20

A multi-instance service chain online deployment algorithm for edge environments
SONG Hu,GAN Rang-xing,XIA Fei,ZOU Hao-dong. A multi-instance service chain online deployment algorithm for edge environments[J]. Computer Engineering & Science, 2021, 43(2): 218-227. DOI: 10.3969/j.issn.1007-130X.2021.02.005
Authors:SONG Hu  GAN Rang-xing  XIA Fei  ZOU Hao-dong
Affiliation:(1.State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing 210023;2.Xintong Branch,State Grid Jiangsu Electric Power Co.,Ltd.,Nanjing 210023,China)
Abstract:The limited resources of edge devices make it necessary to deeply understand the resource consumption of network functions to deploy edge services. Through the deployment experiment of containerized network functions on wireless routers, it is concluded that in addition to the computational overhead of processing business flows, communication between network function instances will also consume a lot of CPU resources. Based on this observation, the distributed deployment of network function instances on peer-to-peer edge devices at close range and relatively low load is considered, and the traffic under the condition of satisfying delay constraints are balanced, thereby minimizing the edge device load. Therefore, a fine-grained service chain load model is proposed, and on this basis, a multi-instance service chain online deployment algorithm for edge environments is designed and implemented. The algorithm includes three components: the delay satisfaction path search based on the pruning search strategy, the deployment path selection based on the nested Top K strategy, and the network function deployment based on the greedy strategy. Simulation experiments verify the effectiveness of the algorithm. The experimental results show that compared to the deployment of network function chains without considering communication overhead, the algorithm proposed in this paper can reduce the CPU load of edge devices by 10%, which is close to the theoretical optimal deployment result.
Keywords:edge computing  network function virtualization  service chain deployment  
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机工程与科学》浏览原始摘要信息
点击此处可从《计算机工程与科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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