Linear time distributed construction of colored trees for disjoint multipath routing

Srinivasan Ramasubramanian, Mithun Harkara, Marwan M Krunz

Research output: Contribution to journalArticle

24 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 data over the multiple paths, the latter being particularly significant in datagram networks. One approach to reduce the number of routing table entries for disjoint 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)
Pages (from-to)2854-2866
Number of pages13
JournalComputer Networks
Volume51
Issue number10
DOIs
StatePublished - Jul 11 2007

Fingerprint

Parallel algorithms

Keywords

  • Colored trees
  • Disjoint routing
  • Multipath routing
  • Redundant trees

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

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

In: Computer Networks, Vol. 51, No. 10, 11.07.2007, p. 2854-2866.

Research output: Contribution to journalArticle

Ramasubramanian, Srinivasan ; Harkara, Mithun ; Krunz, Marwan M. / Linear time distributed construction of colored trees for disjoint multipath routing. In: Computer Networks. 2007 ; Vol. 51, No. 10. pp. 2854-2866.
@article{67ddcbdb4cda4591ba0ed56d776cc249,
title = "Linear time distributed 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 data over the multiple paths, the latter being particularly significant in datagram networks. One approach to reduce the number of routing table entries for disjoint 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.",
keywords = "Colored trees, Disjoint routing, Multipath routing, Redundant trees",
author = "Srinivasan Ramasubramanian and Mithun Harkara and Krunz, {Marwan M}",
year = "2007",
month = "7",
day = "11",
doi = "10.1016/j.comnet.2006.11.029",
language = "English (US)",
volume = "51",
pages = "2854--2866",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "10",

}

TY - JOUR

T1 - Linear time distributed construction of colored trees for disjoint multipath routing

AU - Ramasubramanian, Srinivasan

AU - Harkara, Mithun

AU - Krunz, Marwan M

PY - 2007/7/11

Y1 - 2007/7/11

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 data over the multiple paths, the latter being particularly significant in datagram networks. One approach to reduce the number of routing table entries for disjoint 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 data over the multiple paths, the latter being particularly significant in datagram networks. One approach to reduce the number of routing table entries for disjoint 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.

KW - Colored trees

KW - Disjoint routing

KW - Multipath routing

KW - Redundant trees

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

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

U2 - 10.1016/j.comnet.2006.11.029

DO - 10.1016/j.comnet.2006.11.029

M3 - Article

AN - SCOPUS:34247578542

VL - 51

SP - 2854

EP - 2866

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 10

ER -