This study deals with the capacitated multicast tree (CMT) problem, which consists of finding a set of minimum cost multicasting trees rooted at a source node satisfying the traffic requirements at end-nodes. This paper proposes a dynamic programming based algorithm with two phases. In the first phase, the algorithm generates feasible solutions to satisfy the traffic capacity constraint. It finds the optimal multicast trees using matching procedure in the second phase. The proposed algorithm for the CMT problem can be used for efficient multimedia traffic distribution in local area network. Performance evaluation shows that the proposed algorithm has good efficiency for small network with light traffic.
CITATION STYLE
Lee, Y. J. (2006). Multimedia traffic distribution using capacitated multicast tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4317, pp. 212–220). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/11951957_20
Mendeley helps you to discover research relevant for your work.