大规模网络环境下的虚拟网络映射算法

Shun-li Zhang, Xue-song Qiu, Luoming Meng
{"title":"大规模网络环境下的虚拟网络映射算法","authors":"Shun-li Zhang, Xue-song Qiu, Luoming Meng","doi":"10.1109/ChinaCom.2011.6158256","DOIUrl":null,"url":null,"abstract":"A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, this paper proposes virtual network mapping algorithm for large-scale network based on small-world characteristic of complex network and network coordinate system. We compare our algorithm with algorithm D-ViNE. Experimental results show that our algorithm improves the overall performance.","PeriodicalId":339961,"journal":{"name":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Virtual network mapping algorithm for large-scale network environment\",\"authors\":\"Shun-li Zhang, Xue-song Qiu, Luoming Meng\",\"doi\":\"10.1109/ChinaCom.2011.6158256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, this paper proposes virtual network mapping algorithm for large-scale network based on small-world characteristic of complex network and network coordinate system. We compare our algorithm with algorithm D-ViNE. Experimental results show that our algorithm improves the overall performance.\",\"PeriodicalId\":339961,\"journal\":{\"name\":\"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ChinaCom.2011.6158256\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ChinaCom.2011.6158256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

网络虚拟化的一个主要挑战是虚拟网络资源分配问题,该问题处理虚拟节点和虚拟链路到底层网络资源的有效映射。然而,现有的算法几乎都集中在随机的小规模网络拓扑上,不适合实际的大规模网络环境,因为需要花费更多的时间遍历SN和VN,导致VN请求拥塞。针对这一问题,本文提出了基于复杂网络的小世界特性和网络坐标系的大规模网络虚拟网络映射算法。我们将我们的算法与D-ViNE算法进行比较。实验结果表明,该算法提高了整体性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Virtual network mapping algorithm for large-scale network environment
A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, this paper proposes virtual network mapping algorithm for large-scale network based on small-world characteristic of complex network and network coordinate system. We compare our algorithm with algorithm D-ViNE. Experimental results show that our algorithm improves the overall performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信