版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Bokay Janos St 36-42 H-1083 Budapest Hungary
出 版 物:《COMPUTER NETWORKS》 (计算机网络)
年 卷 期:2022年第213卷第0期
页 面:1页
核心收录:
学科分类:0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:National Research Development and Innovation Fund of Hungary [FIEK_16-1-2016-0007]
主 题:Service Function Chaining Network Function Virtualization Multi-cloud Latency Routing Linear programming
摘 要:The advent of virtualization-based infrastructure needed for 5G brought new challenges in utilizing the existing physical network infrastructure effectively. Designing physical routes between virtual network functions in a multi-cloud environment is usually handled as a maximum flow problem, separately considering latency requirements. This paper presents an algorithm designed for low latency edge-cloud environments, where results meet both bandwidth and latency requirements of the planned traffic in one step. The proposed algorithm is much faster compared to the wide-spread linear program based flow maximization approach as the incorporated filtering of route candidates by latency allows more efficient search. The paper demonstrates the operation of the algorithm by a detailed example.