On Efficient Core Selection for Reducing Multicast Delay Variation under Delay Constraints

Moonseong KIM  Young-Cheol BANG  Hyung-Jin LIM  Hyunseung CHOO  

IEICE TRANSACTIONS on Communications   Vol.E89-B   No.9   pp.2385-2393
Publication Date: 2006/09/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e89-b.9.2385
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Section on Networking Technologies for Overlay Networks)
multicast routing,  delay variation,  delay- and delay variation-bounded multicast tree (DVBMT) problem,  

Full Text: PDF>>
Buy this Article

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.