On algorithm for the delay- and delay variation-bounded multicast trees based on estimation

Youngjin Ahn; Moonseong Kim; Young Cheol Bang; Hyunseung Choo

doi:10.1007/11557654_34

On algorithm for the delay- and delay variation-bounded multicast trees based on estimation

Youngjin Ahn
, Moonseong Kim
, Young Cheol Bang
, Hyunseung Choo

Department of Computer Science and Engineering

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

5 Scopus citations

Abstract

With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to optimize the Delay- and delay Variation-Bounded Multicast Tree (DVBMT) problem. In this paper, we propose a new algorithm for the DVBMT solution. The proposed algorithm outperforms other algorithms up to 9%-25% in terms of the delay variation.

Original language	English
Title of host publication	High Performance Computing and Communcations - First International Conference, HPCC 2005, Proceedings
Pages	277-282
Number of pages	6
DOIs	https://doi.org/10.1007/11557654_34
State	Published - 2005
Event	1st International Conference on High Performance Computing and Communcations, HPCC 2005 - Sorrento, Italy Duration: 21 Sep 2005 → 23 Sep 2005

Publication series

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

Conference

Conference	1st International Conference on High Performance Computing and Communcations, HPCC 2005
Country/Territory	Italy
City	Sorrento
Period	21/09/05 → 23/09/05

Access to Document

10.1007/11557654_34

Cite this

Ahn, Y., Kim, M., Bang, Y. C., & Choo, H. (2005). On algorithm for the delay- and delay variation-bounded multicast trees based on estimation. In High Performance Computing and Communcations - First International Conference, HPCC 2005, Proceedings (pp. 277-282). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3726 LNCS). https://doi.org/10.1007/11557654_34

Ahn, Youngjin ; Kim, Moonseong ; Bang, Young Cheol et al. / On algorithm for the delay- and delay variation-bounded multicast trees based on estimation. High Performance Computing and Communcations - First International Conference, HPCC 2005, Proceedings. 2005. pp. 277-282 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{46850cede98f43ea89a73d5b2cd5c182,

title = "On algorithm for the delay- and delay variation-bounded multicast trees based on estimation",

abstract = "With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to optimize the Delay- and delay Variation-Bounded Multicast Tree (DVBMT) problem. In this paper, we propose a new algorithm for the DVBMT solution. The proposed algorithm outperforms other algorithms up to 9\%-25\% in terms of the delay variation.",

author = "Youngjin Ahn and Moonseong Kim and Bang, \{Young Cheol\} and Hyunseung Choo",

year = "2005",

doi = "10.1007/11557654\_34",

language = "English",

isbn = "3540290311",

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

pages = "277--282",

booktitle = "High Performance Computing and Communcations - First International Conference, HPCC 2005, Proceedings",

note = "1st International Conference on High Performance Computing and Communcations, HPCC 2005 ; Conference date: 21-09-2005 Through 23-09-2005",

}

Ahn, Y, Kim, M, Bang, YC & Choo, H 2005, On algorithm for the delay- and delay variation-bounded multicast trees based on estimation. in High Performance Computing and Communcations - First International Conference, HPCC 2005, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3726 LNCS, pp. 277-282, 1st International Conference on High Performance Computing and Communcations, HPCC 2005, Sorrento, Italy, 21/09/05. https://doi.org/10.1007/11557654_34

On algorithm for the delay- and delay variation-bounded multicast trees based on estimation. / Ahn, Youngjin; Kim, Moonseong; Bang, Young Cheol et al.
High Performance Computing and Communcations - First International Conference, HPCC 2005, Proceedings. 2005. p. 277-282 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3726 LNCS).

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

TY - GEN

T1 - On algorithm for the delay- and delay variation-bounded multicast trees based on estimation

AU - Ahn, Youngjin

AU - Kim, Moonseong

AU - Bang, Young Cheol

AU - Choo, Hyunseung

PY - 2005

Y1 - 2005

N2 - With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to optimize the Delay- and delay Variation-Bounded Multicast Tree (DVBMT) problem. In this paper, we propose a new algorithm for the DVBMT solution. The proposed algorithm outperforms other algorithms up to 9%-25% in terms of the delay variation.

AB - With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to optimize the Delay- and delay Variation-Bounded Multicast Tree (DVBMT) problem. In this paper, we propose a new algorithm for the DVBMT solution. The proposed algorithm outperforms other algorithms up to 9%-25% in terms of the delay variation.

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

U2 - 10.1007/11557654_34

DO - 10.1007/11557654_34

M3 - Conference contribution

AN - SCOPUS:33646433015

SN - 3540290311

SN - 9783540290315

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

SP - 277

EP - 282

BT - High Performance Computing and Communcations - First International Conference, HPCC 2005, Proceedings

T2 - 1st International Conference on High Performance Computing and Communcations, HPCC 2005

Y2 - 21 September 2005 through 23 September 2005

ER -

Ahn Y, Kim M, Bang YC, Choo H. On algorithm for the delay- and delay variation-bounded multicast trees based on estimation. In High Performance Computing and Communcations - First International Conference, HPCC 2005, Proceedings. 2005. p. 277-282. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11557654_34

On algorithm for the delay- and delay variation-bounded multicast trees based on estimation

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this