基于遗传算法的服务功能链贪心备份方法研究OA
Research on Greedy Backup Method of Service Function Chain Based on Genetic Algorithm
在网络功能虚拟化(NFV)环境中,虚拟网络功能及其基础设施的故障可能会严重损害服务功能链的可用性,并影响整体网络性能,成为NFV架构中的核心挑战之一.为了应对这一难题,提出一种基于遗传算法的服务功能链贪心备份方法.首先,提出一种基于生成对抗网络(GAN)的边缘节点故障预测模型,以预测节点的健康状况;其次,优先选择能够显著提升系统可用性的VNF作为备份对象,从而减少所需的备份VNF数量;最后,利用遗传算法的迭代优化,为需要备份的VNF部署最优的节点和链路,提出一种确保服务功能链高可用性的备份方法.仿真结果表明,相比KSP方法,该方案将资源消耗降低32%,服务链请求接受率提升11%,平均备份比例稳定维持在0.5.该方法通过"预测—筛选—优化"的闭环机制,显著提升了动态网络环境下服务链的鲁棒性与资源利用效率.
In network function virtualization(NFV)environments,failures of virtual network functions(VNFs)and their infrastructure can severely compromise the availability of service function chains(SFCs)and degrade overall network performance,posing a critical challenge in NFV architectures.To address this issue,this paper proposes a genetic algorithm-based greedy backup method for SFCs.First,a Generative Adversarial Network(GAN)-enabled edge node fault prediction model is developed to assess node health status,thereby avoiding the use of high-risk nodes for backup.Second,a greedy strategy prioritizes VNF instances that maximize system availability improvements while mini-mizing resource consumption,ensuring efficient backup selection.Third,leveraging iterative optimization via genetic algorithms,the method optimally deploys backup VNFs across nodes and links to guarantee SFC high availability.Simulation results demonstrate that,compared to the K-Shortest Path(KSP)method,the proposed approach reduces resource consumption by 32%,increases SFC request acceptance rates by 11%,and maintains an average backup ratio of 0.5.By integrating a closed-loop"prediction-sifting-optimization"mechanism,this method significantly enhances SFC robustness and resource utilization efficiency in dynamic network environments.
杨雪;陈卓
重庆理工大学 计算机科学与工程学院,重庆 400054重庆理工大学 计算机科学与工程学院,重庆 400054
信息技术与安全科学
故障预测遗传算法虚拟网络功能可用性备份
failure predictiongenetic algorithmvirtual network functionsavailabilitybackup
《软件导刊》 2026 (4)
140-147,8
评论