Distributed linear time construction of colored trees for disjoint multipath routing

  • Authors:

  • Srinivasan Ramasubramanian;Mithun Harkara;Marwan Krunz

  • 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:
  • 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
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.