Fragmentation-aware survivable Routing and Spectrum Assignment in elastic optical networks

Christian Thiessen, C. Cavdar
{"title":"Fragmentation-aware survivable Routing and Spectrum Assignment in elastic optical networks","authors":"Christian Thiessen, C. Cavdar","doi":"10.1109/RNDM.2014.7014937","DOIUrl":null,"url":null,"abstract":"Transparent elastic optical networks (EON) allow provisioning connections with different bandwidth requirements in an efficient way. To achieve the high spectrum efficiency under dynamic traffic scenario, fragmentation-aware Routing, Modulation and Spectrum Assignment (RMSA) decisions is essential. Since fiber cuts are common, resiliency against single-link failures is another important topic. This can be provided efficiently through shared-path protection, which in turn complicates the connection provisioning problem. Unlike existing algorithms that decide first the primary and then the backup path, we introduce an algorithm in this paper that considers pairs of primary and backup paths. To select a candidate pair, we use a hybrid cost function that combines three different objectives: (1) the separation of primary and backup connections to different ends of the spectrum; (2) fragmentation-awareness as a pro-active provisioning objective trying to avoid fragmentation especially among primary resources and (3) maximization of shareability of backup resources among primary paths of link-disjoint connections. Using network level simulations in a scaled-down sample US network with load values of 190-240 Erlang, and bandwidth requests corresponding to 1% blocking probability, an average improvement of 79% compared to a recently presented reference algorithm is shown.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RNDM.2014.7014937","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Transparent elastic optical networks (EON) allow provisioning connections with different bandwidth requirements in an efficient way. To achieve the high spectrum efficiency under dynamic traffic scenario, fragmentation-aware Routing, Modulation and Spectrum Assignment (RMSA) decisions is essential. Since fiber cuts are common, resiliency against single-link failures is another important topic. This can be provided efficiently through shared-path protection, which in turn complicates the connection provisioning problem. Unlike existing algorithms that decide first the primary and then the backup path, we introduce an algorithm in this paper that considers pairs of primary and backup paths. To select a candidate pair, we use a hybrid cost function that combines three different objectives: (1) the separation of primary and backup connections to different ends of the spectrum; (2) fragmentation-awareness as a pro-active provisioning objective trying to avoid fragmentation especially among primary resources and (3) maximization of shareability of backup resources among primary paths of link-disjoint connections. Using network level simulations in a scaled-down sample US network with load values of 190-240 Erlang, and bandwidth requests corresponding to 1% blocking probability, an average improvement of 79% compared to a recently presented reference algorithm is shown.
弹性光网络中碎片感知存活路由和频谱分配
透明弹性光网络(EON)可以高效地提供不同带宽需求的连接。为了在动态业务场景下实现高频谱效率,分片感知路由、调制和频谱分配(RMSA)决策至关重要。由于光纤切割是常见的,针对单链路故障的弹性是另一个重要的主题。这可以通过共享路径保护有效地提供,这反过来又使连接供应问题复杂化。与现有的先确定主路径后确定备份路径的算法不同,本文引入了一种考虑主路径和备份路径对的算法。为了选择候选对,我们使用了一个混合成本函数,该函数结合了三个不同的目标:(1)分离到频谱不同末端的主连接和备份连接;(2)碎片感知作为一种主动供应目标,试图避免碎片,特别是在主要资源之间;(3)在链路断开连接的主要路径之间最大化备份资源的可共享性。在负载值为190-240 Erlang,带宽请求对应于1%阻塞概率的按比例缩小的样本美国网络中使用网络级模拟,与最近提出的参考算法相比,平均改进了79%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信