IEICE Transactions on Communications, vol. E89-B, no. 9, pp. 2385-2393, Sep. 2006 (SCI, IF 0.290)
Moongseong Kim, Young-Cheol Bang, Hyung-Jin Lim, and Hyunseung Choo
With the proliferation of multimedia group applications, the construction of multicast trees satisfying the Quality of Service (QoS) requirements is becoming a problem of the prime importance. An essential factor of these real-time application is to optimize the Delay- and delay Variation-Bounded Multicast Tree (DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as NP-complete problem. The representative algorithms for the problem are DVMA, DDVCA, and so on. In this paper, we show that the proposed algorithm outperforms any other algorithm. The efficiency of our algorithm is verified through the performance evaluation and the enhancement is up to about 13.5% in terms of the multicast delay variation. The time complexity of our algorithm is O(mn2) which is comparable to well known DDVCA.
Multicast routing, Delay variation, Delay and delay variation-bounded multicast tree(DVBMT) problem