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 Citations (Scopus)

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
StatePublished - 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

Multipath Routing
Parallel algorithms
Linear Time
Disjoint
Disjoint Paths
Vertex of a graph
Path
Path Length
Multipath
Distributed Algorithms
Table
Routing
Robustness
Demonstrate

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

Distributed linear time construction of colored trees for disjoint multipath routing. / Ramasubramanian, Srinivasan; Harkara, Mithun; Krunz, Marwan M.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3976 LNCS 2006. p. 1026-1038 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3976 LNCS).

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

Ramasubramanian, S, Harkara, M & Krunz, MM 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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3976 LNCS, pp. 1026-1038, 5th International IFIP-TC6 Networking Conference, Networking 2006, Coimbra, Portugal, 5/15/06. https://doi.org/10.1007/11753810_85
Ramasubramanian S, Harkara M, Krunz MM. 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. 2006. p. 1026-1038. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11753810_85
Ramasubramanian, Srinivasan ; Harkara, Mithun ; Krunz, Marwan M. / Distributed linear time construction of colored trees for disjoint multipath routing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3976 LNCS 2006. pp. 1026-1038 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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 Krunz, {Marwan M}",
year = "2006",
doi = "10.1007/11753810_85",
language = "English (US)",
isbn = "3540341927",
volume = "3976 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "1026--1038",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Distributed linear time construction of colored trees for disjoint multipath routing

AU - Ramasubramanian, Srinivasan

AU - Harkara, Mithun

AU - Krunz, Marwan M

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33745900758&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745900758&partnerID=8YFLogxK

U2 - 10.1007/11753810_85

DO - 10.1007/11753810_85

M3 - Conference contribution

SN - 3540341927

SN - 9783540341925

VL - 3976 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1026

EP - 1038

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -