首页> 外文会议>International Conference on Computer Communication and Networks >Failure-Inference-Based Fast Reroute with Progressive Link Metric Increments
【24h】

Failure-Inference-Based Fast Reroute with Progressive Link Metric Increments

机译:基于故障推断的快速重路由,具有渐进式链接指标增量

获取原文

摘要

This paper is focused on providing fast reroute and loop-free convergence in traditional IP networks, without making any modifications to the IP datagram and without requiring any coordination between routers for FIB updates. Failure inference based fast route (FIFR) is an approach in which routers adjacent to a failed link or router perform local rerouting around the failure, without notifying non-adjacent routers about the failure. The non-adjacent routers utilize interface-specific forwarding tables, which are precomputed based on potential inferred failures that could cause a packet for a given destination to arrive through that unusual interface, to ensure loop-free forwarding towards the destination. However, as long as the failure lasts, packets that were to be forwarded over the failed link traverse suboptimal paths, as they reach the router adjacent to the failure and then are rerouted along a detour. Therefore, in case of a long-lasting failure, it is desirable to trigger a network-wide link state update, so that all routers can converge to new optimal forwarding tables. But, without some coordination between routers to install their forwarding entries in a specific order, there may be transient forwarding loops during the convergence period. As we are interested in a mechanism that does not require any such coordination between routers, we consider the possibility of employing progressive link state updates. In this paper, we show that FIFR with progressive link metric increments can guarantee loop-free forwarding not only before/after but during convergence too and protect against non-partitioning single link failures.
机译:本文的重点是在传统IP网络中提供快速的重新路由和无环路融合,而无需对IP数据报进行任何修改,也不需要在路由器之间进行任何FIB更新的协调。基于故障推断的快速路由(FIFR)是一种方法,在该方法中,与故障链路相邻的路由器或路由器在故障周围执行本地重新路由,而不会将故障通知给不相邻的路由器。不相邻的路由器利用特定于接口的转发表,这些转发表是根据潜在的推断故障进行预先计算的,这些故障可能导致给定目标的数据包通过该异常接口到达,以确保向目标的无环路转发。但是,只要故障持续存在,要通过故障链路转发的数据包就会经过次优路径,因为它们到达与故障相邻的路由器,然后沿tour回路径重新路由。因此,在持久故障的情况下,希望触发网络范围的链路状态更新,以便所有路由器都可以收敛到新的最佳转发表。但是,如果路由器之间不进行任何协调以按特定顺序安装其转发条目,则在收敛期间可能会出现短暂的转发环路。由于我们对不需要路由器之间任何此类协调的机制感兴趣,因此我们考虑采用渐进式链路状态更新的可能性。在本文中,我们表明具有渐进式链路度量增量的FIFR不仅可以保证收敛之前/之后而且在收敛过程中也可以保证无环转发,并且可以防止非分区单链路故障。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号