软件定义并行多径SFC编排  

Software-defined Parallel Multipath SFC Orchestration

作　　者：蔚松霖 周金和[1] WEI Songlin;ZHOU Jinhe(School of Information and Communication Engineering,Beijing Information Science and Technology University,Beijing 100101,China)

机构地区：[1]北京信息科技大学信息与通信工程学院,北京100101

出　　处：《电讯技术》2024年第8期1195-1205,共11页Telecommunication Engineering

基　　金：国家自然科学基金资助项目(61901043,61872044)。

摘　　要：网络功能虚拟化(Network Functions Virtualization, NFV)技术可以通过动态实例化以及根据随时间变化的服务需求去动态地部署虚拟网络功能。基于NFV的多域网络切片中服务功能链(Service Function Chaining, SFC)的编排问题研究缺乏考虑多域场景,大多数启发式算法仅仅考虑了上界,SFC映射策略无法满足低时延高可靠要求。建立了面向并行业务流服务时延优化的数学模型,并进一步基于拉格朗日松弛法提出了一种考虑了下界的启发式SFC映射策略,可以有效地降低时延,提高服务的可靠性。与多租户边缘网络中可靠的SFC编排算法以及多路径低延迟SFC编排算法相比,所提算法平均包交付率分别提升了3.3%和7.4%,平均资源消耗分别降低了9%和19.2%。Network function virtualization(NFV)technology can dynamically deploy virtual network functions through dynamic instantiation and according to time-varying service requirements.Existing research on the orchestration of Service Function Chaining(SFC)in NFV-based multi-domain network slicing is lack of consideration of multi-domain scenarios.Most heuristic algorithms only consider the upper bound and SFC mapping strategies cannot meet the requirements of low latency and high reliability.A mathematical model towards the service delay optimization of parallel service flows is established.A heuristic SFC mapping strategy considering the lower bound is further proposed based on the Lagrangian relaxation method,which can effectively reduce the latency and improve the reliability of the service.Compared with the reliable SFC orchestration algorithm and multi-path low-latency SFC orchestration algorithm in multi-tenant edge networks,the proposed algorithm increases the average packet delivery rate by 3.3%and 7.4%and reduces the average resource consumption by 9% and 19.2%,respectively.

关 键 词：软件定义网络 虚拟网络功能 服务功能链 网络切片 拉格朗日松弛法 

分 类 号：TN915[电子电信—通信与信息系统] TP393[电子电信—信息与通信工程]