
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

On Efficient Core Selection for Reducing Multicast Delay Variation under Delay Constraints
Moonseong KIM YoungCheol BANG HyungJin LIM Hyunseung CHOO
Publication
IEICE TRANSACTIONS on Communications
Vol.E89B
No.9
pp.23852393 Publication Date: 2006/09/01
Online ISSN: 17451345
DOI: 10.1093/ietcom/e89b.9.2385
Print ISSN: 09168516 Type of Manuscript: Special Section PAPER (Special Section on Networking Technologies for Overlay Networks) Category: Keyword: multicast routing, delay variation, delay and delay variationbounded multicast tree (DVBMT) problem,
Full Text: PDF(893.4KB)>>
Summary:
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 realtime application is to optimize the Delay and delay VariationBounded Multicast Tree (DVBMT) problem. This problem is to satisfy the minimum delay variation and the endtoend delay within an upper bound. The DVBMT problem is known as NPcomplete 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(mn^{2}) which is comparable to well known DDVCA.

