全光网络SRLG故障定位

M. L. Ali, P. Ho, János Tapolcai
{"title":"全光网络SRLG故障定位","authors":"M. L. Ali, P. Ho, János Tapolcai","doi":"10.1109/RNDM.2015.7325232","DOIUrl":null,"url":null,"abstract":"This paper introduces a novel m-trail allocation method for achieving local unambiguous failure localization (L-UFL) in all-optical mesh networks under the monitoring burst (m-burst) framework, in which a single monitoring node (MN) can localize any multi-link failure with up to d links in a (d+1)-connected network by inspecting the optical bursts traversing through the MN where each m-trails is originated from the MN. The proposed m-trail allocation method is based on the theory that when each undirected link is traversed by a unique set of m-trails and the m-trail set is not a subset of the m-trails traversing any shared risk link group (SRLG) having d links whenever the SRLG is disjoint from the link, each SRLG having 1 to d links will be traversed by a unique set of m-trails. We prove the theorem for m-trail allocation, formulate an integer linear program (ILP) based on the theorem, and implement the method for up to 3-link failures. Numerical results show that the proposed method outperform the previous arts that do not use post-processing to reduce the m-trails in the solution.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SRLG fault localization in all-optical networks\",\"authors\":\"M. L. Ali, P. Ho, János Tapolcai\",\"doi\":\"10.1109/RNDM.2015.7325232\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a novel m-trail allocation method for achieving local unambiguous failure localization (L-UFL) in all-optical mesh networks under the monitoring burst (m-burst) framework, in which a single monitoring node (MN) can localize any multi-link failure with up to d links in a (d+1)-connected network by inspecting the optical bursts traversing through the MN where each m-trails is originated from the MN. The proposed m-trail allocation method is based on the theory that when each undirected link is traversed by a unique set of m-trails and the m-trail set is not a subset of the m-trails traversing any shared risk link group (SRLG) having d links whenever the SRLG is disjoint from the link, each SRLG having 1 to d links will be traversed by a unique set of m-trails. We prove the theorem for m-trail allocation, formulate an integer linear program (ILP) based on the theorem, and implement the method for up to 3-link failures. Numerical results show that the proposed method outperform the previous arts that do not use post-processing to reduce the m-trails in the solution.\",\"PeriodicalId\":248916,\"journal\":{\"name\":\"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RNDM.2015.7325232\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RNDM.2015.7325232","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文介绍了一种在监测突发(m-burst)框架下实现全光网状网络局部无二义故障定位(L-UFL)的新颖m-trail分配方法,该方法中单个监测节点(MN)可以通过检测穿越MN的光突发来定位(d+1)连接网络中多达d条链路的任何多链路故障,而每个m-trail都起源于MN。所提出的m-trail分配方法基于这样的理论:当每个无向链路被唯一的m-trail集遍历时,并且m-trail集不是遍历任何具有d条链路的共享风险链路组(SRLG)的m-trail的子集,当SRLG与链路断开时,每个具有1到d条链路的SRLG将被唯一的m-trail集遍历。我们证明了m-径分配定理,在此定理的基础上建立了一个整数线性规划(ILP),并实现了最多3链路故障的方法。数值结果表明,该方法优于以往不使用后处理来减少解中的m-轨迹的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SRLG fault localization in all-optical networks
This paper introduces a novel m-trail allocation method for achieving local unambiguous failure localization (L-UFL) in all-optical mesh networks under the monitoring burst (m-burst) framework, in which a single monitoring node (MN) can localize any multi-link failure with up to d links in a (d+1)-connected network by inspecting the optical bursts traversing through the MN where each m-trails is originated from the MN. The proposed m-trail allocation method is based on the theory that when each undirected link is traversed by a unique set of m-trails and the m-trail set is not a subset of the m-trails traversing any shared risk link group (SRLG) having d links whenever the SRLG is disjoint from the link, each SRLG having 1 to d links will be traversed by a unique set of m-trails. We prove the theorem for m-trail allocation, formulate an integer linear program (ILP) based on the theorem, and implement the method for up to 3-link failures. Numerical results show that the proposed method outperform the previous arts that do not use post-processing to reduce the m-trails in the solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信