An algorithm for multicast tree generation in networks with asymmetric links

INFOCOM, pp. 337-344, 1996.

Cited by: 39|Bibtex|Views16|Links
EI WOS
Keywords:
polynomialstelecommunication network routingtrees (mathematics)algorithmasymmetric linksMore(12+)

Abstract:

We formulate the problem of multicast tree generation in asymmetric networks as one of computing a directed Steiner tree of minimal cost. We present a new polynomial-time algorithm that provides for trade-off selection, using a single parameter κ, between the tree-cost (Steiner cost) and the runtime efficiency. Using theoretical analysis,...More

Code:

Data:

Your rating :
0

 

Best Paper
Best Paper of INFOCOM, 1996
Tags
Comments