用神经网络联合优化网络服务链的部署,效率与成功率均显著提升
Simultaneous Genetic Evolution of Neural Networks for Optimal SFC Embedding
- 设计三组正弦激活的神经网络,协同进化实现链路、虚拟功能与组合的联合优化
- 在48个数据中心场景中100%找到最优解,远超次优方法的71%成功率
- 比第二快的遗传算法快近23分钟,适合高要求的实时网络资源调度
组织对计算机网络的依赖依赖于网络可编程性,通常通过服务功能链(Service Function Chaining)实现。该技术将网络功能虚拟化、链接并程序化地部署在基础设施上。服务功能链的最优嵌入是一个NP难问题,包含链组合、虚拟网络功能嵌入和链路嵌入三个子问题,必须同时优化而非顺序处理才能获得最优结果。已有遗传算法方法未能同时优化全部三个子问题。本文提出基于遗传算法的GENESIS方法,通过演化三个正弦函数激活的神经网络,将其输出融合至高斯分布和A*算法,实现三个子问题的同步优化。我们在模拟器上对GENESIS进行了评估,覆盖48种不同数据中心场景,并与两种先进遗传算法及一种贪心算法对比。结果显示,GENESIS在所有场景中均找到最优解(100%),而次优方法仅能优化71%。此外,GENESIS是所有遗传算法中最快的,平均耗时15.84分钟,优于次优遗传算法的平均38.62分钟。
原文摘要 · Abstract (English)
The reliance of organisations on computer networks is enabled by network programmability, which is typically achieved through Service Function Chaining. These chains virtualise network functions, link them, and programmatically embed them on networking infrastructure. Optimal embedding of Service Function Chains is an NP-hard problem, with three sub-problems, chain composition, virtual network function embedding, and link embedding, that have to be optimised simultaneously, rather than sequentially, for optimal results. Genetic Algorithms have been employed for this, but existing approaches either do not optimise all three sub-problems or do not optimise all three sub-problems simultaneously. We propose a Genetic Algorithm-based approach called GENESIS, which evolves three sine-function-activated Neural Networks, and funnels their output to a Gaussian distribution and an A* algorithm to optimise all three sub-problems simultaneously. We evaluate GENESIS on an emulator across 48 different data centre scenarios and compare its performance to two state-of-the-art Genetic Algorithms and one greedy algorithm. GENESIS produces an optimal solution for 100% of the scenarios, whereas the second-best method optimises only 71% of the scenarios. Moreover, GENESIS is the fastest among all Genetic Algorithms, averaging 15.84 minutes, compared to an average of 38.62 minutes for the second-best Genetic Algorithm.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。