Multipath Routing and Dual Link Failure Recovery in IP Networks Using Three Link-Independent Trees
The authors develop an approach for disjoint multipath routing and fast recovery in IP networks that guarantees recovery from arbitrary two link failures. They employ three link-independent trees, referred to as red, blue, and green trees, rooted at every destination. The path from a source to the destination on the trees are mutually link-disjoint. The routing of packets is based on the destination address and the input interface over which the packet was received. They discuss different ways of employing the three link-independent trees for multipath routing and/or failure recovery. If the trees are employed exclusively for multipath routing, then no packet overhead is required.