Permutation routing for increased robustness in IP networks

Authors:
Hung Quoc Vo;Olav Lysne;Amund Kvalbein
Affiliations:
Simula Research Laboratory, Norway;Simula Research Laboratory, Norway;Simula Research Laboratory, Norway
Venue:
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Year:
2012

Citing 6
Cited 0

Loop-free routing using diffusing computations

IEEE/ACM Transactions on Networking (TON)
Energy-Efficient Permutation Routing in Radio Networks

IEEE Transactions on Parallel and Distributed Systems
Fast local rerouting for handling transient link failures

IEEE/ACM Transactions on Networking (TON)
IGP link weight assignment for operational Tier-1 backbones

IEEE/ACM Transactions on Networking (TON)
Multiple routing configurations for fast IP network recovery

IEEE/ACM Transactions on Networking (TON)
On the feasibility and efficacy of protection routing in IP networks

INFOCOM'10 Proceedings of the 29th conference on Information communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.