An algorithm for multicast tree generation in networks with asymmetric links
INFOCOM, pp. 337-344, 1996.
polynomialstelecommunication network routingtrees (mathematics)algorithmasymmetric linksMore(12+)
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
Full Text (Upload PDF)
PPT (Upload PPT)
Best Paper of INFOCOM, 1996