Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Disjoint multipath routing using colored trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
Linear time distributed construction of colored trees for disjoint multipath routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
IEEE Journal on Selected Areas in Communications
Fast recovery from dual-link or single-node failures in IP networks using tunneling
IEEE/ACM Transactions on Networking (TON)
Constructing disjoint paths for failure recovery and multipath routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Independent directed acyclic graphs for resilient multipath routing
IEEE/ACM Transactions on Networking (TON)
On identifying additive link metrics using linearly independent cycles and paths
IEEE/ACM Transactions on Networking (TON)
Dual path communications over multiple spanning trees for networked control systems
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
Colored Trees (CTs) is an efficient approach to route packets along link-or node-disjoint paths in packet-switched networks. In this approach, two trees, namely red and blue, are constructed rooted at a drain such that the path from any node to the drain are link-or node-disjoint. For applications where both the trees are used simultaneously, it is critical to maintain the trees after link or node failures. To this end, this paper develops an algorithm, referred to as SimCT, that efficiently constructs and maintains colored trees under failures using only local informa-tion. Even when the entire tree needs to be recomputed, the SimCT algorithm requires 40% lesser messages than previous techniques. The convergence time of the SimCT algorithm is linear in the number of nodes. We show through extensive simulations that the average length of the disjoint paths obtained using the SimCT algorithm is lesser compared to the previously known techniques. The above-mentioned improvements are obtained by exploiting the relationship between DFS numbering, lowpoint values, and the potentials employed for maintaining partial ordering of nodes. The SimCT algorithm is also extended to obtain colored trees in multi-drain networks.