Skip to Main Content
In this paper, we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) to achieve resilient multipath routing. Link- independent (Node-independent) DAGs satisfy the property that any path from a source to the root on one DAG is link-disjoint (node-disjoint) with any path from the source to the root on the other DAG. Given a network, we develop polynomial time algorithms to compute link-independent and node-independent DAGs. The algorithm developed in this paper: (1) achieves multipath routing; (2) guarantees recovery from single link failure; (3) utilizes all possible edges; and (4) achieves all these with at most one bit per packet as overhead when routing is based on destination address and incoming link. We demonstrate the effectiveness of the proposed IDAGs approach by comparing key performance indices to that of the independent trees technique.