多流共享备份路径保护网状网络的双故障可用性分析

Wenjing Wang, J. Doucette
{"title":"多流共享备份路径保护网状网络的双故障可用性分析","authors":"Wenjing Wang, J. Doucette","doi":"10.1109/RNDM.2016.7608278","DOIUrl":null,"url":null,"abstract":"Dual-failure availability is an important metric for a survivable network where the restoration of all single failures is fully satisfied. This paper develops an algorithm to evaluate network dual-failure availability for shared backup path protection mesh networks with the existing multi-flow design model. We create four network families and each network family has eleven networks with average nodal degree ranging from 3.0 to 5.0. Experiments are implemented in Python 2.7, and results reveal that the values of network dual-failure availability increase first and then drops mildly when the average nodal degree of network increases. The proposed algorithm is scalable with network scales.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Dual-failure availability analysis for multi-flow shared backup path protected mesh networks\",\"authors\":\"Wenjing Wang, J. Doucette\",\"doi\":\"10.1109/RNDM.2016.7608278\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dual-failure availability is an important metric for a survivable network where the restoration of all single failures is fully satisfied. This paper develops an algorithm to evaluate network dual-failure availability for shared backup path protection mesh networks with the existing multi-flow design model. We create four network families and each network family has eleven networks with average nodal degree ranging from 3.0 to 5.0. Experiments are implemented in Python 2.7, and results reveal that the values of network dual-failure availability increase first and then drops mildly when the average nodal degree of network increases. The proposed algorithm is scalable with network scales.\",\"PeriodicalId\":422165,\"journal\":{\"name\":\"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RNDM.2016.7608278\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RNDM.2016.7608278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

双故障可用性是生存网络的重要指标,在这种网络中,所有单故障的恢复都是完全满足的。本文在现有多流设计模型的基础上,提出了一种评估共享备份路径保护网状网络双故障可用性的算法。我们创建了4个网络族,每个网络族有11个网络,平均节点度从3.0到5.0不等。在Python 2.7中实现实验,结果表明,随着网络平均节点度的增加,网络双故障可用性值先增加后温和下降。该算法具有网络规模可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dual-failure availability analysis for multi-flow shared backup path protected mesh networks
Dual-failure availability is an important metric for a survivable network where the restoration of all single failures is fully satisfied. This paper develops an algorithm to evaluate network dual-failure availability for shared backup path protection mesh networks with the existing multi-flow design model. We create four network families and each network family has eleven networks with average nodal degree ranging from 3.0 to 5.0. Experiments are implemented in Python 2.7, and results reveal that the values of network dual-failure availability increase first and then drops mildly when the average nodal degree of network increases. The proposed algorithm is scalable with network scales.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信