By Topic

Resilient Multipath Routing with Independent Directed Acyclic Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sangman Cho ; Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ, USA ; Elhourani, T. ; Ramasubramanian, S.

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.

Published in:

Communications (ICC), 2010 IEEE International Conference on

Date of Conference:

23-27 May 2010