Design and analysis of partial protection mechanisms in groomed optical WDM mesh networks

M. Sivakumar, Jing Fang, K. Sivalingam, Arun Kumar Somani
{"title":"Design and analysis of partial protection mechanisms in groomed optical WDM mesh networks","authors":"M. Sivakumar, Jing Fang, K. Sivalingam, Arun Kumar Somani","doi":"10.1364/JON.7.000617","DOIUrl":null,"url":null,"abstract":"We consider the problem of survivable network design in traffic-groomed optical WDM mesh networks that support subwavelength capacity connections. In typical survivable network designs, individual sessions are provided either full protection or no protection. We consider a quality of protection (QoP) framework where a connection is provided partial protection, i.e., when a link failure occurs on the primary path, the protection bandwidth provided on the backup path is less than or equal to the primary bandwidth. Each connection request specifies the primary bandwidth and a minimum backup bandwidth required. The network will guarantee at least the minimum backup bandwidth and, if capacity is available, higher backup bandwidth up to the primary path's bandwidth. The advantage of such a model is that it can reduce backup capacity requirements based on connection needs leading to lower blocking probability and lower network costs. We consider two scenarios: (i) a network with static traffic that is designed using an integer linear program (ILP) formulation and (ii) a network with dynamic traffic for which we present a heuristic connection admission control algorithm that prevents backup resource contention during recovery from a link failure. The results quantify the gain in blocking probability for different partial protection scenarios. The mechanism proposed to counter backup contention is seen to provide an average of 120% reduction in the contention among backup paths of connections traversing a link, especially when the number of wavelengths in each link is small.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"617-634"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000617","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Optical Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1364/JON.7.000617","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

We consider the problem of survivable network design in traffic-groomed optical WDM mesh networks that support subwavelength capacity connections. In typical survivable network designs, individual sessions are provided either full protection or no protection. We consider a quality of protection (QoP) framework where a connection is provided partial protection, i.e., when a link failure occurs on the primary path, the protection bandwidth provided on the backup path is less than or equal to the primary bandwidth. Each connection request specifies the primary bandwidth and a minimum backup bandwidth required. The network will guarantee at least the minimum backup bandwidth and, if capacity is available, higher backup bandwidth up to the primary path's bandwidth. The advantage of such a model is that it can reduce backup capacity requirements based on connection needs leading to lower blocking probability and lower network costs. We consider two scenarios: (i) a network with static traffic that is designed using an integer linear program (ILP) formulation and (ii) a network with dynamic traffic for which we present a heuristic connection admission control algorithm that prevents backup resource contention during recovery from a link failure. The results quantify the gain in blocking probability for different partial protection scenarios. The mechanism proposed to counter backup contention is seen to provide an average of 120% reduction in the contention among backup paths of connections traversing a link, especially when the number of wavelengths in each link is small.
修整光WDM网状网络中部分保护机制的设计与分析
我们考虑了支持亚波长容量连接的业务量培养光WDM网状网络中的生存性网络设计问题。在典型的可生存网络设计中,单个会话要么提供完全保护,要么不提供保护。我们考虑一个提供部分保护的连接质量(QoP)框架,即当主路径上发生链路故障时,备份路径上提供的保护带宽小于或等于主带宽。每个连接请求指定所需的主带宽和最小备份带宽。网络将至少保证最低备份带宽,如果容量可用,则保证更高的备份带宽,最高可达主路径的带宽。该模型的优点是可以根据连接需求减少备份容量需求,从而降低阻塞概率,降低网络成本。我们考虑两种情况:(i)使用整数线性规划(ILP)公式设计的静态流量网络;(ii)动态流量网络,我们提出了一种启发式连接接纳控制算法,可防止链路故障恢复期间备份资源争用。结果量化了不同部分保护方案的阻塞概率增益。所提出的对抗备份争用的机制可以使穿越一条链路的连接的备份路径之间的争用平均减少120%,特别是当每个链路中的波长数较小时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信