KAR: Key-for-Any-Route, a Resilient Routing System
- 3 October 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 120-127
Abstract
This paper proposes KAR (Key-for-Any-Route), a new intra-domain resilient routing system in which edge-nodes set a route ID to select any existing route as an alternative to safely forward packets to their destination. In KAR routing system, a route is defined as the remainder of the division between a route ID and a set of switch IDs along the path(s) between a pair of nodes. KAR-enabled switches explore the existing routes by using special properties of Residue Number System as our encoding technique. Packets are deviated from the faulty link (liveness condition) with routing deflections. Deflected packets are guided to their original destination due to resilient forwarding paths added to the route ID. Three deflection methods are discussed along emulation experiments. Results show that KAR efficiently allows deflected packets to automatically reach their destination, imposing a bound on packets disordering measured in TCP throughput.Keywords
This publication has 14 references indexed in Scilit:
- Source-Based Path Selection2015
- SlickFlow: Resilient source routing in Data Center Networks unlocked by OpenFlow2013
- A Demonstration of Fast Failure Recovery in Software Defined Networking2012
- Slick packets2011
- SafeGuard2009
- Exploiting residue number system for power-efficient digital signal processing in embedded processors2009
- Path splicingACM SIGCOMM Computer Communication Review, 2008
- Source selectable path diversity via routing deflectionsACM SIGCOMM Computer Communication Review, 2006
- Chinese Remainder Theorem1996
- The Residue Number SystemIEEE Transactions on Electronic Computers, 1959