Independent directed acyclic graphs for resilient multipath routing

Authors:
Sangman Cho;Theodore Elhourani;Srinivasan Ramasubramanian
Affiliations:
Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ;Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ;Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2012

Citing 9
Cited 0

Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

IEEE/ACM Transactions on Networking (TON)
Linear time distributed construction of colored trees for disjoint multipath routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
Polynomial time approximation algorithms for multi-constrained QoS routing

IEEE/ACM Transactions on Networking (TON)
Maintaining colored trees for disjoint multipath routing under node failures

IEEE/ACM Transactions on Networking (TON)
Failure insensitive routing for ensuring service availability

IWQoS'03 Proceedings of the 11th international conference on Quality of service
Path splicing with guaranteed fault tolerance

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Congestion-oriented shortest multipath routing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Distributed linear time construction of colored trees for disjoint multipath routing

NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to achieve resilient multipath routing, we introduce the concept of independent directed acyclic graphs (IDAGs) in this paper. 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) provides multipath routing; 2) utilizes all possible edges; 3) guarantees recovery from single link failure; and 4) achieves all these with at most one bit per packet as overhead when routing is based on destination address and incoming edge. We show the effectiveness of the proposed IDAGs approach by comparing key performance indices to that of the independent trees and multiple pairs of independent trees techniques through extensive simulations.