Survivable Virtual Network Embedding Model with Shared Protection over Elastic Optical Network

Fujun He, Takehiro Sato, E. Oki
{"title":"Survivable Virtual Network Embedding Model with Shared Protection over Elastic Optical Network","authors":"Fujun He, Takehiro Sato, E. Oki","doi":"10.1109/CloudNet47604.2019.9064141","DOIUrl":null,"url":null,"abstract":"This paper proposes a survivable virtual network embedding model over elastic optical network with considering the shared protection against any single substrate node or link failure. We consider the backup computing and bandwidth resource sharing to reduce the required backup resources. A heuristic algorithm with polynomial time complexity is presented to solve the problem with considering promoting the backup resource sharing. The results observe that the rejection ratio is reduced about 60% in average by introducing the shared protection compared to the dedicated protection in our examined scenarios.","PeriodicalId":340890,"journal":{"name":"2019 IEEE 8th International Conference on Cloud Networking (CloudNet)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 8th International Conference on Cloud Networking (CloudNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CloudNet47604.2019.9064141","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

This paper proposes a survivable virtual network embedding model over elastic optical network with considering the shared protection against any single substrate node or link failure. We consider the backup computing and bandwidth resource sharing to reduce the required backup resources. A heuristic algorithm with polynomial time complexity is presented to solve the problem with considering promoting the backup resource sharing. The results observe that the rejection ratio is reduced about 60% in average by introducing the shared protection compared to the dedicated protection in our examined scenarios.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
弹性光网络中具有共享保护的生存性虚拟网络嵌入模型
本文提出了一种弹性光网络上的可生存虚拟网络嵌入模型,该模型考虑了对任意单一基板节点或链路故障的共享保护。我们考虑了备份计算和带宽资源共享,以减少所需的备份资源。在考虑促进备份资源共享的情况下,提出了一种多项式时间复杂度的启发式算法。结果表明,在我们所研究的场景中,与专用保护相比,引入共享保护的拒绝率平均降低了约60%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Preventive Start-time Optimization to Determine Link Weights against Multiple Link Failures Collaborative Traffic Measurement in Virtualized Data Center Networks A stable matching method for cloud scheduling Dynamic Sketch: Efficient and Adjustable Heavy Hitter Detection for Software Packet Processing Minimizing state access delay for cloud-native network functions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1