基于图注意力网络的服务功能链路径优化研究

Research on Optimization of Service Function Chain Path Based on Graph Attention Network

服务功能链(SFC)路径生成旨在为用户提供高速率、低延迟的多样化网络功能定制服务。现有的SFC路径选择算法大多都针对特定网络拓扑结构或使用单一评价指标,存在泛化性弱、评价标准单一的问题。针对此,该文提出基于图注意力网络(GAT)的SFC路径选择优化模型(SFC-GAT),其核心不再固定网络拓扑结构,而是将SFC路径选择问题建模为路径注意力问题。通过重新设计路径选择图和路径更新策略方式,增强模型泛化性;从时延和负载能力综合角度评价路径优化效果,解决路径性能单一评价问题。仿真实验结果表明:相比于约束下最短路径和最小过载路径选择策略,SFC-GAT至少能提高12%和7%选择路径综合性能。

Service Function Chain(SFC)path generation aims to provide users with diversified network function customization services with high speed and low delay.Most of the existing SFC path selection algorithms aim at specific network topology or use a single evaluation index,which has the problems of weak generalization and single evaluation standard.In view of this,an SFC path selection optimization model(SFCGAT)based on Graph ATtention network(GAT)is proposed.Its core is no longer to fix the network topology,but to model the SFC path selection problem as a path attention problem.The generalization of the model is enhanced by redesigning the path selection diagram and path update strategy;The effect of path optimization from the perspective of delay and load capacity is evaluated to solve the problem of single evaluation of path performance.The simulation results show that compared with the shortest path and minimum overload path selection strategy under constraints,SFC-GAT can improve the comprehensive performance of path selection by at least 12%and 7%.