Multicast Tree Generation in Networks with Asymmetric Links (1996)
| Venue: | IEEE/ACM Transactions on Networking |
| Citations: | 69 - 0 self |
BibTeX
@ARTICLE{Ramanathan96multicasttree,
author = {S. Ramanathan},
title = {Multicast Tree Generation in Networks with Asymmetric Links},
journal = {IEEE/ACM Transactions on Networking},
year = {1996},
volume = {4},
pages = {558--568}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We formulate the problem of multicast tree generation as one of computing a directed Steiner tree of minimal cost. In this context, we present a polynomial-time algorithm that provides for tradeoff selection, using a single parameter , between the tree-cost (Steiner cost) and the runtime efficiency. Further, the same algorithm may be used for delay optimization or tree-cost minimization simply by configuring the value of appropriately. We present theoretical and experimental analysis characterizing the problem and the performance of our algorithm. Theoretically, we (1) show that it is highly unlikely that there exists a polynomial-time algorithm with a performance guarantee of constant times optimum cost, (2) introduce metrics for measuring the asymmetry of graphs, and (3) show that the worst-case cost of the tree produced by our algorithm is at most twice the optimum cost times the asymmetry, for two of these asymmetry metrics. For graphs with bounded asymmetry, this gives constant ...
