@inproceedings{78206ec4156c44cf9c360d5b641134e2,
title = "Distributed linear time construction of colored trees for disjoint multipath routing",
abstract = "Disjoint multipath routing (DMPR) is an effective strategy to achieve robustness in networks, where data is forwarded along multiple link- or node-disjoint paths. DMPR poses significant challenges in terms of obtaining loop-free multiple (disjoint) paths and effectively forwarding the data over the multiple paths, the latter being particularly significant in datagram networks. One approach to reduce the number of routing table entries for multipath forwarding is to construct two trees, namely red and blue, rooted at a destination node such that the paths from a source to the destination on the two trees are link/node-disjoint. This paper develops the first distributed algorithm for constructing the colored trees whose running time is linear in the number of links in the network. The paper also demonstrates the effectiveness of employing generalized low-point concept rather than traditional low-point concept in the DFS-tree to reduce the average path lengths on the colored trees.",
author = "Srinivasan Ramasubramanian and Mithun Harkara and Marwan Krunz",
year = "2006",
doi = "10.1007/11753810_85",
language = "English (US)",
isbn = "3540341927",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "1026--1038",
editor = "Thomas Plagemann and Burkhard Stiller and Cedric Westphal and Fernando Boavida and Edmundo Monteiro",
booktitle = "Networking 2006 - Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Com. Syst. - 5th Int. IFIP-TC6 Netw. Conf. Proc.",
note = "5th International IFIP-TC6 Networking Conference, Networking 2006 ; Conference date: 15-05-2006 Through 19-05-2006",
}