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

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

doi:10.1093/ietcom/e89-b.9.2385

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

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

Full Text Views

0

Share
Cite this

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 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(mn²) which is comparable to well known DDVCA.

Publication: IEICE TRANSACTIONS on Communications Vol.E89-B No.9 pp.2385-2393

Publication Date: 2006/09/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e89-b.9.2385

Type of Manuscript: Special Section PAPER (Special Section on Networking Technologies for Overlay Networks)

Category

Cite this

Copy

Moonseong KIM, Young-Cheol BANG, Hyung-Jin LIM, Hyunseung CHOO, "On Efficient Core Selection for Reducing Multicast Delay Variation under Delay Constraints" in IEICE TRANSACTIONS on Communications, vol. E89-B, no. 9, pp. 2385-2393, September 2006, doi: 10.1093/ietcom/e89-b.9.2385.
Abstract: 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(mn²) which is comparable to well known DDVCA.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.9.2385/_p

Copy

@ARTICLE{e89-b_9_2385,
author={Moonseong KIM, Young-Cheol BANG, Hyung-Jin LIM, Hyunseung CHOO, },
journal={IEICE TRANSACTIONS on Communications},
title={On Efficient Core Selection for Reducing Multicast Delay Variation under Delay Constraints},
year={2006},
volume={E89-B},
number={9},
pages={2385-2393},
abstract={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(mn²) which is comparable to well known DDVCA.},
keywords={},
doi={10.1093/ietcom/e89-b.9.2385},
ISSN={1745-1345},
month={September},}

Copy

TY - JOUR
TI - On Efficient Core Selection for Reducing Multicast Delay Variation under Delay Constraints
T2 - IEICE TRANSACTIONS on Communications
SP - 2385
EP - 2393
AU - Moonseong KIM
AU - Young-Cheol BANG
AU - Hyung-Jin LIM
AU - Hyunseung CHOO
PY - 2006
DO - 10.1093/ietcom/e89-b.9.2385
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2006
AB - 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(mn²) which is comparable to well known DDVCA.
ER -