DMCA
Extending Greedy Multicast Routing to Delay Sensitive Applications (1999)
| Citations: | 11 - 2 self |
BibTeX
@MISC{Goel99extendinggreedy,
author = {Ashish Goel and Kameshwar Munagala},
title = {Extending Greedy Multicast Routing to Delay Sensitive Applications},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Given a weighted undirected graph G(V; E) and a subset R of V , a Steiner tree is a subtree of G that contains each vertex in R. In this paper, we present an online algorithm for nding a Steiner tree that simultaneously approximates the shortest path tree and the minimum weight Steiner tree, when the vertices in the set R are revealed in an online fashion. This problem arises naturally while trying to construct source-based multicast trees of low cost and good delay. The cost of the tree we construct is within an O(log jRj) factor of the optimal cost, and the path length from the root to any terminal is at most O(1) times the shortest path length. The algorithm needs to perform at most one reroute for each node in the tree. Our algorithm extends the results of Khuller et al.and Awerbuch et al., who looked at the oine problem [9, 2]. We conduct extensive simulations to compare the performance of our algorithm (in terms of cost and delay) with that of two popular multicast ro...
Keyphrases
greedy multicast routing delay sensitive application path length steiner tree good delay minimum weight steiner tree oine problem low cost awerbuch et al source-based multicast tree popular multicast ro weighted undirected graph optimal cost online algorithm log jrj extensive simulation path tree online fashion
