Link Independent and Node Independent Algorithms for Efficient Multipath Routing

Provided by: The World
Topic: Data Management
Format: PDF
Link-independent and 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. To achieve resilient multipath routing, first introduce the concept of Independent Directed Acyclic Graphs (IDAGs). For a given a network, the authors develop polynomial-time algorithms to compute link independent and node-independent DAGs. The algorithm developed in this paper is provides multipath routing, utilizes all possible edges, guarantees recovery from single link failure and achieves all these with at most one bit per packet as overhead when routing is based on destination address and incoming edge.

Find By Topic