An efficient multicast tree with delay and delay variation constraints

Moonseong Kim; Young Cheol Bang; Jong S. Yang; Hyunseung Choo

doi:10.1007/11751595_118

An efficient multicast tree with delay and delay variation constraints

Moonseong Kim
, Young Cheol Bang
, Jong S. Yang
, Hyunseung Choo

Department of Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

With the rapid evolution of real time multimedia applications like audio/video conferencing, interactive distributed games and real time remote control system, a certain Quality of Service (QoS) needs to be guaranteed in underlying networks. Multicast routing algorithms should support the required QoS. There are two important QoS parameters, bounded delay and delay variation, that need to be guaranteed in order to support the real time multimedia applications. Here we solve Delay and delay Variation Bounded Multicast Tree (DVBMT) problem which has been proved to NP-complete. In this paper, we propose an efficient algorithm for DVBMT. The performance enhancement is up to about 21.7% in terms of delay variation as compared to the well-known algorithm, KBC [9].

Original language	English
Title of host publication	Computational Science and Its Applications - ICCSA 2006
Subtitle of host publication	International Conference, Proceedings - Part III
Publisher	Springer Verlag
Pages	1129-1136
Number of pages	8
ISBN (Print)	3540340750, 9783540340751
DOIs	https://doi.org/10.1007/11751595_118
State	Published - 2006
Event	ICCSA 2006: International Conference on Computational Science and Its Applications - Glasgow, United Kingdom Duration: 8 May 2006 → 11 May 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3982 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	ICCSA 2006: International Conference on Computational Science and Its Applications
Country/Territory	United Kingdom
City	Glasgow
Period	8/05/06 → 11/05/06

Access to Document

10.1007/11751595_118

Cite this

Kim, M., Bang, Y. C., Yang, J. S., & Choo, H. (2006). An efficient multicast tree with delay and delay variation constraints. In Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part III (pp. 1129-1136). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3982 LNCS). Springer Verlag. https://doi.org/10.1007/11751595_118

Kim, Moonseong ; Bang, Young Cheol ; Yang, Jong S. et al. / An efficient multicast tree with delay and delay variation constraints. Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part III. Springer Verlag, 2006. pp. 1129-1136 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{01ee38ff53fe4aebb997b207b7e733b0,

title = "An efficient multicast tree with delay and delay variation constraints",

abstract = "With the rapid evolution of real time multimedia applications like audio/video conferencing, interactive distributed games and real time remote control system, a certain Quality of Service (QoS) needs to be guaranteed in underlying networks. Multicast routing algorithms should support the required QoS. There are two important QoS parameters, bounded delay and delay variation, that need to be guaranteed in order to support the real time multimedia applications. Here we solve Delay and delay Variation Bounded Multicast Tree (DVBMT) problem which has been proved to NP-complete. In this paper, we propose an efficient algorithm for DVBMT. The performance enhancement is up to about 21.7\% in terms of delay variation as compared to the well-known algorithm, KBC [9].",

author = "Moonseong Kim and Bang, \{Young Cheol\} and Yang, \{Jong S.\} and Hyunseung Choo",

year = "2006",

doi = "10.1007/11751595\_118",

language = "English",

isbn = "3540340750",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1129--1136",

booktitle = "Computational Science and Its Applications - ICCSA 2006",

note = "ICCSA 2006: International Conference on Computational Science and Its Applications ; Conference date: 08-05-2006 Through 11-05-2006",

}

Kim, M, Bang, YC, Yang, JS & Choo, H 2006, An efficient multicast tree with delay and delay variation constraints. in Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part III. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3982 LNCS, Springer Verlag, pp. 1129-1136, ICCSA 2006: International Conference on Computational Science and Its Applications, Glasgow, United Kingdom, 8/05/06. https://doi.org/10.1007/11751595_118

An efficient multicast tree with delay and delay variation constraints. / Kim, Moonseong; Bang, Young Cheol; Yang, Jong S. et al.
Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part III. Springer Verlag, 2006. p. 1129-1136 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3982 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An efficient multicast tree with delay and delay variation constraints

AU - Kim, Moonseong

AU - Bang, Young Cheol

AU - Yang, Jong S.

AU - Choo, Hyunseung

PY - 2006

Y1 - 2006

N2 - With the rapid evolution of real time multimedia applications like audio/video conferencing, interactive distributed games and real time remote control system, a certain Quality of Service (QoS) needs to be guaranteed in underlying networks. Multicast routing algorithms should support the required QoS. There are two important QoS parameters, bounded delay and delay variation, that need to be guaranteed in order to support the real time multimedia applications. Here we solve Delay and delay Variation Bounded Multicast Tree (DVBMT) problem which has been proved to NP-complete. In this paper, we propose an efficient algorithm for DVBMT. The performance enhancement is up to about 21.7% in terms of delay variation as compared to the well-known algorithm, KBC [9].

AB - With the rapid evolution of real time multimedia applications like audio/video conferencing, interactive distributed games and real time remote control system, a certain Quality of Service (QoS) needs to be guaranteed in underlying networks. Multicast routing algorithms should support the required QoS. There are two important QoS parameters, bounded delay and delay variation, that need to be guaranteed in order to support the real time multimedia applications. Here we solve Delay and delay Variation Bounded Multicast Tree (DVBMT) problem which has been proved to NP-complete. In this paper, we propose an efficient algorithm for DVBMT. The performance enhancement is up to about 21.7% in terms of delay variation as compared to the well-known algorithm, KBC [9].

UR - https://www.scopus.com/pages/publications/33745874082

U2 - 10.1007/11751595_118

DO - 10.1007/11751595_118

M3 - Conference contribution

AN - SCOPUS:33745874082

SN - 3540340750

SN - 9783540340751

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1129

EP - 1136

BT - Computational Science and Its Applications - ICCSA 2006

PB - Springer Verlag

T2 - ICCSA 2006: International Conference on Computational Science and Its Applications

Y2 - 8 May 2006 through 11 May 2006

ER -

Kim M, Bang YC, Yang JS, Choo H. An efficient multicast tree with delay and delay variation constraints. In Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part III. Springer Verlag. 2006. p. 1129-1136. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11751595_118

An efficient multicast tree with delay and delay variation constraints

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this