Connection provisioning with feasible shareability determination for availability-aware design of optical networks

B. Kantarci, H. Mouftah, S. Oktug
{"title":"Connection provisioning with feasible shareability determination for availability-aware design of optical networks","authors":"B. Kantarci, H. Mouftah, S. Oktug","doi":"10.1109/ICTON.2008.4598645","DOIUrl":null,"url":null,"abstract":"In this paper, we present two adaptive connection provisioning algorithms to offer better availability per connection under dynamic traffic with shared backup path protection. The proposed schemes monitor the status of the network in terms of resource consumption and average unavailability per connection and adapt the sharing degree for the links. We compare our heuristic and optimized sharing degree approach with a conventional connection provisioning approach under two different topologies. The simulation results show that our proposed approaches offer better availability to incoming connection requests. Results referring to resource overbuild guarantee that shared backup protection is not violated since resource overbuild is kept in a feasible range.","PeriodicalId":230802,"journal":{"name":"2008 10th Anniversary International Conference on Transparent Optical Networks","volume":"151 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 10th Anniversary International Conference on Transparent Optical Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTON.2008.4598645","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

In this paper, we present two adaptive connection provisioning algorithms to offer better availability per connection under dynamic traffic with shared backup path protection. The proposed schemes monitor the status of the network in terms of resource consumption and average unavailability per connection and adapt the sharing degree for the links. We compare our heuristic and optimized sharing degree approach with a conventional connection provisioning approach under two different topologies. The simulation results show that our proposed approaches offer better availability to incoming connection requests. Results referring to resource overbuild guarantee that shared backup protection is not violated since resource overbuild is kept in a feasible range.
可用性感知光网络设计中具有可共享性的连接配置
在本文中,我们提出了两种自适应连接分配算法,在共享备份路径保护的动态流量下提供更好的每个连接的可用性。所提出的方案根据资源消耗和每个连接的平均不可用性来监控网络状态,并调整链路的共享程度。在两种不同的拓扑结构下,我们比较了启发式和优化的共享度方法与传统的连接提供方法。仿真结果表明,我们提出的方法对传入的连接请求提供了更好的可用性。参考资源过度构建的结果保证了共享备份保护不会被破坏,因为资源过度构建保持在一个可行的范围内。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信