Boost online virtual network embedding: Using neural networks for admission control

Andreas Blenk, Patrick Kalmbach, Patrick van der Smagt, W. Kellerer
{"title":"Boost online virtual network embedding: Using neural networks for admission control","authors":"Andreas Blenk, Patrick Kalmbach, Patrick van der Smagt, W. Kellerer","doi":"10.1109/CNSM.2016.7818395","DOIUrl":null,"url":null,"abstract":"The allocation of physical resources to virtual networks, i.e., the virtual network embedding (VNE), is still an on-going research field due to its problem complexity. While many solutions for the online VNE problem exist, only few have focused on methods that can be generally applied for optimization of online embeddings. In this paper, we propose an admission control based on a Recurrent Neural Network (RNN) to improve the overall system performance for the online VNE problem. Before running a VNE algorithm to embed a virtual network request, the RNN predicts whether the request will be accepted by the VNE algorithm based on the current state of the substrate and the virtual network request (VNR). The RNN prevents VNE algorithms from spending time on VNRs that are either infeasible or that cannot be embedded in acceptable time. In order to train and operate the RNN efficiently, we additionally propose new representations for substrate networks and virtual network requests. The representations are based on topological and network resource features to represent the substrate network and the VNRs with low computational complexity. Via simulations, we show that our admission control reduces the overall computational time for the online VNE problem by up to 91 % while preserving VNE performance on average. Using our new substrate and request representations, the RNN achieves an accuracy ranging between 89 % and 98 % for different VNE algorithms, substrate sizes, and VNR arrival rates.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 12th International Conference on Network and Service Management (CNSM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNSM.2016.7818395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 38

Abstract

The allocation of physical resources to virtual networks, i.e., the virtual network embedding (VNE), is still an on-going research field due to its problem complexity. While many solutions for the online VNE problem exist, only few have focused on methods that can be generally applied for optimization of online embeddings. In this paper, we propose an admission control based on a Recurrent Neural Network (RNN) to improve the overall system performance for the online VNE problem. Before running a VNE algorithm to embed a virtual network request, the RNN predicts whether the request will be accepted by the VNE algorithm based on the current state of the substrate and the virtual network request (VNR). The RNN prevents VNE algorithms from spending time on VNRs that are either infeasible or that cannot be embedded in acceptable time. In order to train and operate the RNN efficiently, we additionally propose new representations for substrate networks and virtual network requests. The representations are based on topological and network resource features to represent the substrate network and the VNRs with low computational complexity. Via simulations, we show that our admission control reduces the overall computational time for the online VNE problem by up to 91 % while preserving VNE performance on average. Using our new substrate and request representations, the RNN achieves an accuracy ranging between 89 % and 98 % for different VNE algorithms, substrate sizes, and VNR arrival rates.
Boost在线虚拟网络嵌入:利用神经网络进行准入控制
物理资源在虚拟网络中的分配,即虚拟网络嵌入(VNE),由于其问题的复杂性,仍然是一个正在进行的研究领域。虽然存在许多在线VNE问题的解决方案,但只有很少的方法集中在可以普遍应用于在线嵌入优化的方法上。在本文中,我们提出了一种基于递归神经网络(RNN)的准入控制,以提高在线VNE问题的整体系统性能。在运行VNE算法嵌入虚拟网络请求之前,RNN根据基板的当前状态和虚拟网络请求(VNR)来预测请求是否会被VNE算法接受。RNN防止VNE算法在不可行或不能在可接受的时间内嵌入的vnr上花费时间。为了有效地训练和操作RNN,我们还提出了基板网络和虚拟网络请求的新表示。该表示基于拓扑和网络资源特征来表示基板网络和计算复杂度较低的vnr。通过模拟,我们表明,我们的准入控制减少了在线VNE问题的总计算时间高达91%,同时保持了VNE的平均性能。使用我们的新基板和请求表示,对于不同的VNE算法、基板大小和VNR到达率,RNN的准确率在89%到98%之间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信