Permutation Routing for Increased Robustness in IP Networks
Permutation Routing for Increased Robustness in IP Networks
复制标题
DOI：
10.1007/978-3-642-30045-5_17
复制
发表时间：
2012-05
期刊：
影响因子：
--
通讯作者：
Hung Quoc Vo-;Olav Lysne;Amund Kvalbein
中科院分区：
文献类型：
--
作者：
Hung Quoc Vo-;Olav Lysne;Amund Kvalbein
我们将排列路由作为一种通过传统的逐跳转发来提高 IP 网络鲁棒性的方法。排列路由将参与流量转发的路由器视为一系列资源，并创建这些资源的排列，以提供多种转发选项。我们引入排列路由作为一个概念，并使用它来创建我们寻求最大化单链路故障覆盖率的路由。与 IETF 标准化的无环替代 (LFA) 类似，可以轻松地为 OSPF 或 IS-IS 网络实施排列路由，以通过额外的无环转发条目来增强现有的 ECMP 转发，从而提高负载平衡或容错能力。我们的评估表明，与推断网络拓扑中的 LFA 相比，排列路由可以将单链路故障覆盖率提高高达 28%。
We present Permutation Routing as a method for increased robustness in IP networks with traditional hop-by-hop forwarding. Permutation Routing treats routers involved in traffic forwarding as a sequence of resources, and creates permutations of these resources that give several forwarding options. We introduce Permutation Routing as a concept, and use it to create routings where we seek to maximize single link fault coverage. Analogous to the IETF standardized Loop-Free Alternate (LFA), Permutation Routing can easily be implemented for OSPF or IS-IS networks to augment existing ECMP forwarding with additional loop-free forwarding entries for improved load balancing or fault tolerance. Our evaluations show that Permutation Routing can increase single link fault coverage by up to 28% compared to LFA in inferred network topologies.