24-09-2012, 04:42 PM
Independent Directed Acyclic Graphs for Resilient Multipath Routing
ABSTRACT
To achieve resilient multipath routing, the concept of Independent Directed Acyclic Graphs (IDAGs) is introduced. 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. DAGs supports: (1) multipath routing; (2) use all possible edges; (3) recovery from single link failure; and (4) one bit per packet as overhead.