为虚拟网络分配底层网络资源的一种新的鲁棒启发式算法

Sarah Kareche, Sylvain Ductor, Z. Guessoum, M. Mezghiche
{"title":"为虚拟网络分配底层网络资源的一种新的鲁棒启发式算法","authors":"Sarah Kareche, Sylvain Ductor, Z. Guessoum, M. Mezghiche","doi":"10.1109/INDS.2014.16","DOIUrl":null,"url":null,"abstract":"Actually used in the Cloud-Computing concept, network virtualization is a promising way to share distant resources, offer multiple services and architectures to multiple heterogeneous Virtual Networks (VNs) on a common Substrate Network (SN). The main challenge in the VN embedding problem is the efficient mapping of virtual nodes and links to the substrate network resources, avoiding network congestion and responding as well to the desired Service Level Agreement (SLA). Faced with this NP-Hard problem, research focused on designing algorithms, processes, and heuristics which had separate node's allocation and links allocation, where the load balancing on the substrate components is not reached. This paper provides a heuristic solution based on A-Star algorithm. The heuristic relies on constraints of both nodes and links, and aims to maintain a load balancing upon the SN. The solution is gradually built following this heuristic function values with the possibility of back-tracking to explore the maximum of solution components before selecting the suitable allocation. To validate the proposed solution, we carry out several experiments and compare our results with some classical result's works.","PeriodicalId":388358,"journal":{"name":"2014 International Conference on Advanced Networking Distributed Systems and Applications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A New Robust Heuristic for Assigning Substrate Network Resources to Virtual Networks\",\"authors\":\"Sarah Kareche, Sylvain Ductor, Z. Guessoum, M. Mezghiche\",\"doi\":\"10.1109/INDS.2014.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Actually used in the Cloud-Computing concept, network virtualization is a promising way to share distant resources, offer multiple services and architectures to multiple heterogeneous Virtual Networks (VNs) on a common Substrate Network (SN). The main challenge in the VN embedding problem is the efficient mapping of virtual nodes and links to the substrate network resources, avoiding network congestion and responding as well to the desired Service Level Agreement (SLA). Faced with this NP-Hard problem, research focused on designing algorithms, processes, and heuristics which had separate node's allocation and links allocation, where the load balancing on the substrate components is not reached. This paper provides a heuristic solution based on A-Star algorithm. The heuristic relies on constraints of both nodes and links, and aims to maintain a load balancing upon the SN. The solution is gradually built following this heuristic function values with the possibility of back-tracking to explore the maximum of solution components before selecting the suitable allocation. To validate the proposed solution, we carry out several experiments and compare our results with some classical result's works.\",\"PeriodicalId\":388358,\"journal\":{\"name\":\"2014 International Conference on Advanced Networking Distributed Systems and Applications\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Advanced Networking Distributed Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDS.2014.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Advanced Networking Distributed Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDS.2014.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

网络虚拟化实际上用于云计算概念,它是一种很有前途的方式,可以共享远程资源,为公共基板网络(SN)上的多个异构虚拟网络(VNs)提供多种服务和架构。VN嵌入问题的主要挑战是将虚拟节点和链接有效地映射到底层网络资源,避免网络拥塞并响应所需的服务水平协议(SLA)。面对这种NP-Hard问题,研究的重点是设计节点分配和链路分配分开的算法、流程和启发式算法,这些算法、流程和启发式算法无法达到底层组件上的负载均衡。本文提出了一种基于a - star算法的启发式求解方法。启发式算法依赖于节点和链路的约束,目的是在节点上保持负载均衡。根据该启发式函数值逐步构建解决方案,并具有回溯的可能性,以探索解决方案组件的最大值,然后选择合适的分配。为了验证所提出的解决方案,我们进行了几个实验,并将我们的结果与一些经典的结果进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Robust Heuristic for Assigning Substrate Network Resources to Virtual Networks
Actually used in the Cloud-Computing concept, network virtualization is a promising way to share distant resources, offer multiple services and architectures to multiple heterogeneous Virtual Networks (VNs) on a common Substrate Network (SN). The main challenge in the VN embedding problem is the efficient mapping of virtual nodes and links to the substrate network resources, avoiding network congestion and responding as well to the desired Service Level Agreement (SLA). Faced with this NP-Hard problem, research focused on designing algorithms, processes, and heuristics which had separate node's allocation and links allocation, where the load balancing on the substrate components is not reached. This paper provides a heuristic solution based on A-Star algorithm. The heuristic relies on constraints of both nodes and links, and aims to maintain a load balancing upon the SN. The solution is gradually built following this heuristic function values with the possibility of back-tracking to explore the maximum of solution components before selecting the suitable allocation. To validate the proposed solution, we carry out several experiments and compare our results with some classical result's works.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信