Optimal Recovery from Large-Scale Failures in IP Networks

2012 IEEE 32nd International Conference on Distributed Computing Systems Pub Date : 2012-06-18 DOI:10.1109/ICDCS.2012.47

Qiang Zheng, G. Cao, T. L. Porta, A. Swami

{"title":"Optimal Recovery from Large-Scale Failures in IP Networks","authors":"Qiang Zheng, G. Cao, T. L. Porta, A. Swami","doi":"10.1109/ICDCS.2012.47","DOIUrl":null,"url":null,"abstract":"Quickly recovering IP networks from failures is critical to enhancing Internet robustness and availability. Due to their serious impact on network routing, large-scale failures have received increasing attention in recent years. We propose an approach called Reactive Two-phase Rerouting (RTR) for intra-domain routing to quickly recover from large-scale failures with the shortest recovery paths. To recover a failed routing path, RTR first forwards packets around the failure area to collect information on failures. Then, in the second phase, RTR calculates a new shortest path and forwards packets along it through source routing. RTR can deal with large-scale failures associated with areas of any shape and location, and is free of permanent loops. For any failure area, the recovery paths provided by RTR are guaranteed to be the shortest. Extensive simulations based on ISP topologies show that RTR can find the shortest recovery paths for more than 98.6% of failed routing paths with reachable destinations. Compared with prior works, RTR achieves better performance for recoverable failed routing paths and uses much less network resources for irrecoverable failed routing paths.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"10 1","pages":"295-304"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 32nd International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2012.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 22

Abstract

Quickly recovering IP networks from failures is critical to enhancing Internet robustness and availability. Due to their serious impact on network routing, large-scale failures have received increasing attention in recent years. We propose an approach called Reactive Two-phase Rerouting (RTR) for intra-domain routing to quickly recover from large-scale failures with the shortest recovery paths. To recover a failed routing path, RTR first forwards packets around the failure area to collect information on failures. Then, in the second phase, RTR calculates a new shortest path and forwards packets along it through source routing. RTR can deal with large-scale failures associated with areas of any shape and location, and is free of permanent loops. For any failure area, the recovery paths provided by RTR are guaranteed to be the shortest. Extensive simulations based on ISP topologies show that RTR can find the shortest recovery paths for more than 98.6% of failed routing paths with reachable destinations. Compared with prior works, RTR achieves better performance for recoverable failed routing paths and uses much less network resources for irrecoverable failed routing paths.

查看原文本刊更多论文

IP网络大规模故障的最佳恢复

快速从故障中恢复IP网络对于增强Internet健壮性和可用性至关重要。由于大规模故障对网络路由的严重影响，近年来受到越来越多的关注。我们提出了一种称为响应式两相重路由(RTR)的方法，用于域内路由以最短的恢复路径从大规模故障中快速恢复。为了恢复故障的路由路径，RTR首先在故障区域周围转发报文，收集故障信息。然后，在第二阶段，RTR计算一条新的最短路径，并通过源路由沿着这条路径转发数据包。RTR可以处理与任何形状和位置的区域相关的大规模故障，并且没有永久回路。对于任何故障区域，RTR提供的恢复路径都保证最短。基于ISP拓扑的大量仿真结果表明，对于98.6%以上具有可达目的地的故障路由路径，RTR能够找到最短的恢复路径。与以往的工作相比，RTR在可恢复的故障路由路径上取得了更好的性能，并且在不可恢复的故障路由路径上使用了更少的网络资源。

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

求助全文

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

来源期刊

2012 IEEE 32nd International Conference on Distributed Computing Systems

自引率

0.00%

发文量