Evaluating dual-failure restorability in mesh-restorable WDM optical networks

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI:10.1109/ICCCN.2004.1401655

Michael T. Frederick, P. Datta, Arun Kumar Somani

{"title":"Evaluating dual-failure restorability in mesh-restorable WDM optical networks","authors":"Michael T. Frederick, P. Datta, Arun Kumar Somani","doi":"10.1109/ICCCN.2004.1401655","DOIUrl":null,"url":null,"abstract":"Double link failure models, in which any two links in the network fail in an arbitrary order, are becoming critical in survivable optical network design. A significant finding is that designs offering complete dual-failure restorability require almost triple the amount of spare capacity. In this paper, networks are designed to achieve 100% restorability under single link failures, while maximizing coverage against any second link failure in the network. In the event of a single link failure, the restoration model attempts to dynamically find a second alternate link-disjoint end-to-end path to provide coverage against a sequential overlapping link failure. Sub-graph routing (M. T. Frederick et al., Feb. 2003) is extended to provide dual-failure restorability for a network provisioned to tolerate all single-link failures. This strategy is compared with shared-mesh protection. The results indicate that sub-graph routing can achieve overlapping second link failure restorability for 95-99% of connections. It is also observed that sub-graph routing can inherently provide complete dual-failure coverage for ~72-81% of the connections","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"352 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2004.1401655","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 18

Abstract

Double link failure models, in which any two links in the network fail in an arbitrary order, are becoming critical in survivable optical network design. A significant finding is that designs offering complete dual-failure restorability require almost triple the amount of spare capacity. In this paper, networks are designed to achieve 100% restorability under single link failures, while maximizing coverage against any second link failure in the network. In the event of a single link failure, the restoration model attempts to dynamically find a second alternate link-disjoint end-to-end path to provide coverage against a sequential overlapping link failure. Sub-graph routing (M. T. Frederick et al., Feb. 2003) is extended to provide dual-failure restorability for a network provisioned to tolerate all single-link failures. This strategy is compared with shared-mesh protection. The results indicate that sub-graph routing can achieve overlapping second link failure restorability for 95-99% of connections. It is also observed that sub-graph routing can inherently provide complete dual-failure coverage for ~72-81% of the connections

查看原文本刊更多论文

网格可恢复WDM光网络双故障可恢复性评价

双链路失效模型是指网络中任意两条链路按任意顺序失效，它在生存型光网络设计中变得越来越重要。一个重要的发现是，提供完全双故障恢复能力的设计几乎需要三倍的备用容量。在本文中，网络被设计为在单链路故障下实现100%的可恢复性，同时最大限度地覆盖网络中任何第二链路故障。在单个链路故障的情况下，恢复模型尝试动态地找到第二个备用链路-不相交的端到端路径，以提供对顺序重叠链路故障的覆盖。子图路由(M. T. Frederick et al.， 2003年2月)被扩展为为网络提供双故障恢复能力，以容忍所有单链路故障。将该策略与共享网格保护进行了比较。结果表明，子图路由可以在95% ~ 99%的连接上实现重叠第二链路故障的可恢复性。子图路由固有地可以为~72-81%的连接提供完全的双故障覆盖

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)

自引率

0.00%

发文量