基于群智能的VNF布局和SFC路由延迟感知多联合优化方法

Zahida Sharif, Muhammed Basheer Jasser, K. Yau, A. Amphawan
{"title":"基于群智能的VNF布局和SFC路由延迟感知多联合优化方法","authors":"Zahida Sharif, Muhammed Basheer Jasser, K. Yau, A. Amphawan","doi":"10.1109/ICCSCE54767.2022.9935663","DOIUrl":null,"url":null,"abstract":"A coherent placement of virtual network functions (VNFs) permits the efficient forwarding of data flows (routing). VNFs' placement and service function chain (SFC) routing (VNF-PSFCR) in an optimized way to minimize latency has been reported as NP-hard problem. The review of related work highlights the limitations of this domain, which revolve around high time complexity, high delays, and the ignorance of utilization of bandwidth and power consumption. The main consideration of this paper is to solve joint optimization of VNF-PSFCR and envisage the latency requirements of 5G networks. The optimal selection of VNFs and a new routing strategy are required to solve this multi-joint optimization problem via swarm intelligence. Swarm intelligence algorithms, as inspired by the collective behaviors of swarms that offer robust and high-quality solutions, have the viability to solve the mentioned problem effectively compared to conventional algorithms. A novel fuzzy heuristic and swarm intelligence-based algorithm named latency aware multi-joint placement and traffic routing-grey wolf optimizer (LAMPTR-GWO) is proposed in this work to solve the latency minimization problem. The proposed algorithm comprises two phases; the first is the efficient placement of VNFs in the graph, and the second phase is SFC routing. The Takagi Sugeno Kang system (TSK) is employed to guide the wolves to potentially explore the search space and to handle the uncertainties inherent in the NFV infrastructure. It is an effective combination that can achieve the required balance between the exploration and the exploitation of GWO. The proposed algorithm is expected to have the ability to surpass the performance of other swarm algorithms via overcoming the limitations of the GWO for solving the VNF-PSFCR problem.","PeriodicalId":346014,"journal":{"name":"2022 IEEE 12th International Conference on Control System, Computing and Engineering (ICCSCE)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Towards Latency Aware Multi-joint Optimization Method for VNF Placement and SFC Routing Via Swarm Intelligence\",\"authors\":\"Zahida Sharif, Muhammed Basheer Jasser, K. Yau, A. Amphawan\",\"doi\":\"10.1109/ICCSCE54767.2022.9935663\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A coherent placement of virtual network functions (VNFs) permits the efficient forwarding of data flows (routing). VNFs' placement and service function chain (SFC) routing (VNF-PSFCR) in an optimized way to minimize latency has been reported as NP-hard problem. The review of related work highlights the limitations of this domain, which revolve around high time complexity, high delays, and the ignorance of utilization of bandwidth and power consumption. The main consideration of this paper is to solve joint optimization of VNF-PSFCR and envisage the latency requirements of 5G networks. The optimal selection of VNFs and a new routing strategy are required to solve this multi-joint optimization problem via swarm intelligence. Swarm intelligence algorithms, as inspired by the collective behaviors of swarms that offer robust and high-quality solutions, have the viability to solve the mentioned problem effectively compared to conventional algorithms. A novel fuzzy heuristic and swarm intelligence-based algorithm named latency aware multi-joint placement and traffic routing-grey wolf optimizer (LAMPTR-GWO) is proposed in this work to solve the latency minimization problem. The proposed algorithm comprises two phases; the first is the efficient placement of VNFs in the graph, and the second phase is SFC routing. The Takagi Sugeno Kang system (TSK) is employed to guide the wolves to potentially explore the search space and to handle the uncertainties inherent in the NFV infrastructure. It is an effective combination that can achieve the required balance between the exploration and the exploitation of GWO. The proposed algorithm is expected to have the ability to surpass the performance of other swarm algorithms via overcoming the limitations of the GWO for solving the VNF-PSFCR problem.\",\"PeriodicalId\":346014,\"journal\":{\"name\":\"2022 IEEE 12th International Conference on Control System, Computing and Engineering (ICCSCE)\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 12th International Conference on Control System, Computing and Engineering (ICCSCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSCE54767.2022.9935663\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 12th International Conference on Control System, Computing and Engineering (ICCSCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSCE54767.2022.9935663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

虚拟网络功能(VNFs)的一致放置允许有效地转发数据流(路由)。为了最小化延迟,VNFs的布局和SFC路由(VNF-PSFCR)被认为是一个NP-hard问题。对相关工作的回顾突出了该领域的局限性,其围绕高时间复杂性,高延迟以及对带宽和功耗的利用的忽视。本文主要考虑的是解决VNF-PSFCR的联合优化问题,并设想5G网络的时延需求。利用群智能解决这一多节点优化问题需要vnf的最优选择和新的路由策略。群体智能算法受到群体集体行为的启发,提供鲁棒性和高质量的解决方案,与传统算法相比,具有有效解决上述问题的可行性。为了解决时延最小化问题,提出了一种基于模糊启发式和群体智能的延迟感知多关节布局和流量路由灰狼优化算法(LAMPTR-GWO)。该算法包括两个阶段;第一个阶段是在图中有效地放置VNFs,第二个阶段是SFC路由。Takagi Sugeno Kang系统(TSK)被用来引导狼群潜在地探索搜索空间,并处理NFV基础设施固有的不确定性。这是一种有效的组合,可以实现油气勘探与开发之间的平衡。该算法有望克服GWO算法在解决VNF-PSFCR问题上的局限性,超越其他群算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Towards Latency Aware Multi-joint Optimization Method for VNF Placement and SFC Routing Via Swarm Intelligence
A coherent placement of virtual network functions (VNFs) permits the efficient forwarding of data flows (routing). VNFs' placement and service function chain (SFC) routing (VNF-PSFCR) in an optimized way to minimize latency has been reported as NP-hard problem. The review of related work highlights the limitations of this domain, which revolve around high time complexity, high delays, and the ignorance of utilization of bandwidth and power consumption. The main consideration of this paper is to solve joint optimization of VNF-PSFCR and envisage the latency requirements of 5G networks. The optimal selection of VNFs and a new routing strategy are required to solve this multi-joint optimization problem via swarm intelligence. Swarm intelligence algorithms, as inspired by the collective behaviors of swarms that offer robust and high-quality solutions, have the viability to solve the mentioned problem effectively compared to conventional algorithms. A novel fuzzy heuristic and swarm intelligence-based algorithm named latency aware multi-joint placement and traffic routing-grey wolf optimizer (LAMPTR-GWO) is proposed in this work to solve the latency minimization problem. The proposed algorithm comprises two phases; the first is the efficient placement of VNFs in the graph, and the second phase is SFC routing. The Takagi Sugeno Kang system (TSK) is employed to guide the wolves to potentially explore the search space and to handle the uncertainties inherent in the NFV infrastructure. It is an effective combination that can achieve the required balance between the exploration and the exploitation of GWO. The proposed algorithm is expected to have the ability to surpass the performance of other swarm algorithms via overcoming the limitations of the GWO for solving the VNF-PSFCR problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信