基于覆盖网络技术的多网络故障主动恢复方法

Takuro Horie, G. Hasegawa, M. Murata
{"title":"基于覆盖网络技术的多网络故障主动恢复方法","authors":"Takuro Horie, G. Hasegawa, M. Murata","doi":"10.1109/NETWKS.2010.5624903","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a proactive recovery method against multiple network failures for large-scale packet switching networks. The proposed method exploits the overlay networking technique. Specifically, it constructs multiple logical network topologies from the original overlay network topology by assuming various failure patterns. When a failure is detected, our method selects one topology. Consequently, it can immediately recover from the failure by utilizing the selected topology without waiting for routing convergence in the network. When constructing multiple logical topologies, we take into account the correlation among overlay links in terms of the underlay links, and we merge multiple logical topologies into a single topology to decrease the number of topologies while keeping the recovery efficiency. Through the numerical evaluation results of the network reachability and average path length, we show that our method improves network reachability from 69% to 99% while keeping the path length short, when 5% underlay links are simultaneously down.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Proactive recovery method against multiple network failures with overlay networking technique\",\"authors\":\"Takuro Horie, G. Hasegawa, M. Murata\",\"doi\":\"10.1109/NETWKS.2010.5624903\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a proactive recovery method against multiple network failures for large-scale packet switching networks. The proposed method exploits the overlay networking technique. Specifically, it constructs multiple logical network topologies from the original overlay network topology by assuming various failure patterns. When a failure is detected, our method selects one topology. Consequently, it can immediately recover from the failure by utilizing the selected topology without waiting for routing convergence in the network. When constructing multiple logical topologies, we take into account the correlation among overlay links in terms of the underlay links, and we merge multiple logical topologies into a single topology to decrease the number of topologies while keeping the recovery efficiency. Through the numerical evaluation results of the network reachability and average path length, we show that our method improves network reachability from 69% to 99% while keeping the path length short, when 5% underlay links are simultaneously down.\",\"PeriodicalId\":202408,\"journal\":{\"name\":\"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETWKS.2010.5624903\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETWKS.2010.5624903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文针对大规模分组交换网络,提出了一种针对多网络故障的主动恢复方法。该方法利用了覆盖网络技术。具体来说,它通过假设各种故障模式,在原有的叠加网络拓扑基础上构建多个逻辑网络拓扑。当检测到故障时,我们的方法选择一个拓扑。因此,它可以利用所选择的拓扑立即从故障中恢复,而无需等待网络中的路由收敛。在构造多个逻辑拓扑时,从底层链路的角度考虑叠加链路之间的相关性,并将多个逻辑拓扑合并为一个拓扑,在保证恢复效率的同时减少了拓扑的数量。通过对网络可达性和平均路径长度的数值评估结果表明,当5%的底层链路同时断开时,我们的方法在保持路径长度较短的情况下,将网络可达性从69%提高到99%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Proactive recovery method against multiple network failures with overlay networking technique
In this paper, we propose a proactive recovery method against multiple network failures for large-scale packet switching networks. The proposed method exploits the overlay networking technique. Specifically, it constructs multiple logical network topologies from the original overlay network topology by assuming various failure patterns. When a failure is detected, our method selects one topology. Consequently, it can immediately recover from the failure by utilizing the selected topology without waiting for routing convergence in the network. When constructing multiple logical topologies, we take into account the correlation among overlay links in terms of the underlay links, and we merge multiple logical topologies into a single topology to decrease the number of topologies while keeping the recovery efficiency. Through the numerical evaluation results of the network reachability and average path length, we show that our method improves network reachability from 69% to 99% while keeping the path length short, when 5% underlay links are simultaneously down.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信