摘要
针对服务功能链(SFC)部署过程中存在虚拟网络功能(VNF)实例部署成本和转发路径成本难以权衡的问题,提出了基于VNF实例共享的SFC部署算法。首先针对多链SFC建立VNF和虚拟链路映射模型,并预估路径部署长度上限,保证SFC时延需求;其次,在路径部署长度限制范围内,尽可能使VNF实例共享最大化,以平衡链路转发成本和VNF部署成本,最终得到SFC部署策略。与已有的SPH(shortest path heuristic)和GUS(greedy on used server)部署算法相比,所提算法所得的总运营成本分别降低6.6%和12.15%,且当SFC数量增多时,该算法的服务接受率可达89.33%。仿真实验结果表明,提出算法可以在保证用户服务质量的同时有效降低SFC部署成本。
This paper proposed an SFC(service function chaining)placement algorithm based on VNF(virtual network function)instance sharing to address the problem of difficult tradeoff between the deployment cost of VNF instances and forwarding cost in the process of SFC placement.Firstly,for multi-link SFC,it constructed the VNF and virtual link mapping model,and estimated the upper bound of the path deployment length to ensure the SFC delay.Secondly,within the limit of the path length,it maximized the number of the reused VNF instance as much as possible to balance the forwarding cost and the deployment cost of VNF.Finally,it obtained the SFC placement strategy.Compared with the existing SPH(shortest path heuristic)and GUS(greedy on used server)placement algorithms,the total operating expense of the proposed algorithm is 6.6%and 12.15%lower,and when the number of SFC increases,the service acceptance rate of this algorithm can reach 89.33%.The simulation experimental results show that this algorithm can effectively reduce the SFC placement cost while ensuring the quality of service.
作者
王媛滔
舒兆港
钟一文
邱彩钰
田佳霖
Wang Yuantao;Shu Zhaogang;Zhong Yiwen;Qiu Caiyu;Tian Jialin(College of Computer&Information Sciences,Fujian Agriculture&Forestry University,Fuzhou 350002,China)
出处
《计算机应用研究》
CSCD
北大核心
2023年第6期1806-1811,共6页
Application Research of Computers
基金
福建省自然科学基金资助项目(2020J01574)
中国高校产学研创新基金资助项目(2021FNA05003)。
关键词
服务功能链
虚拟网络功能
VNF实例共享
成本优化
service function chain
virtual network function
VNF instance sharing
cost optimization
