Distributed linear time construction of colored trees for disjoint multipath routing

Srinivasan Ramasubramanian, Mithun Harkara, Marwan M Krunz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages1026-1038
Number of pages13
Volume3976 LNCS
DOIs
Publication statusPublished - 2006
Event5th International IFIP-TC6 Networking Conference, Networking 2006 - Coimbra, Portugal
Duration: May 15 2006May 19 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3976 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International IFIP-TC6 Networking Conference, Networking 2006
CountryPortugal
CityCoimbra
Period5/15/065/19/06

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Ramasubramanian, S., Harkara, M., & Krunz, M. M. (2006). Distributed linear time construction of colored trees for disjoint multipath routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3976 LNCS, pp. 1026-1038). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3976 LNCS). https://doi.org/10.1007/11753810_85