Multicast ω-trees based on statistical analysis

Moonseong Kim; Young Cheol Bang; Hyunseung Choo

doi:10.1007/11751595_114

Multicast ω-trees based on statistical analysis

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

Abstract

In this paper, we study the efficient multicast routing tree problem with QoS requirements. The new multicast weight parameter is proposed by efficiently combining two independent measures, the link cost and delay. The weight ω ε [0, 1] plays an important role in combining the two measures. If the ω approaches to 0, then the tree delay is decreasing. On the contrary if it closes to 1, the tree cost is decreasing. Therefore, if the ω is decided, then the efficient multicast tree can be found. A case study shows various multicast trees for each ω. When network users have various QoS requirements, the proposed multicast weight parameter is very informative for them.

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	1090-1099
Number of pages	10
ISBN (Print)	3540340750, 9783540340751
DOIs	https://doi.org/10.1007/11751595_114
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_114

Cite this

Kim, M., Bang, Y. C., & Choo, H. (2006). Multicast ω-trees based on statistical analysis. In Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part III (pp. 1090-1099). (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_114

Kim, Moonseong ; Bang, Young Cheol ; Choo, Hyunseung. / Multicast ω-trees based on statistical analysis. Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part III. Springer Verlag, 2006. pp. 1090-1099 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fea0ea6b1d2346ebab024587f892d0ab,

title = "Multicast ω-trees based on statistical analysis",

abstract = "In this paper, we study the efficient multicast routing tree problem with QoS requirements. The new multicast weight parameter is proposed by efficiently combining two independent measures, the link cost and delay. The weight ω ε [0, 1] plays an important role in combining the two measures. If the ω approaches to 0, then the tree delay is decreasing. On the contrary if it closes to 1, the tree cost is decreasing. Therefore, if the ω is decided, then the efficient multicast tree can be found. A case study shows various multicast trees for each ω. When network users have various QoS requirements, the proposed multicast weight parameter is very informative for them.",

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

year = "2006",

doi = "10.1007/11751595\_114",

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 = "1090--1099",

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 & Choo, H 2006, Multicast ω-trees based on statistical analysis. 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. 1090-1099, ICCSA 2006: International Conference on Computational Science and Its Applications, Glasgow, United Kingdom, 8/05/06. https://doi.org/10.1007/11751595_114

Multicast ω-trees based on statistical analysis. / Kim, Moonseong; Bang, Young Cheol; Choo, Hyunseung.
Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part III. Springer Verlag, 2006. p. 1090-1099 (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 - Multicast ω-trees based on statistical analysis

AU - Kim, Moonseong

AU - Bang, Young Cheol

AU - Choo, Hyunseung

PY - 2006

Y1 - 2006

N2 - In this paper, we study the efficient multicast routing tree problem with QoS requirements. The new multicast weight parameter is proposed by efficiently combining two independent measures, the link cost and delay. The weight ω ε [0, 1] plays an important role in combining the two measures. If the ω approaches to 0, then the tree delay is decreasing. On the contrary if it closes to 1, the tree cost is decreasing. Therefore, if the ω is decided, then the efficient multicast tree can be found. A case study shows various multicast trees for each ω. When network users have various QoS requirements, the proposed multicast weight parameter is very informative for them.

AB - In this paper, we study the efficient multicast routing tree problem with QoS requirements. The new multicast weight parameter is proposed by efficiently combining two independent measures, the link cost and delay. The weight ω ε [0, 1] plays an important role in combining the two measures. If the ω approaches to 0, then the tree delay is decreasing. On the contrary if it closes to 1, the tree cost is decreasing. Therefore, if the ω is decided, then the efficient multicast tree can be found. A case study shows various multicast trees for each ω. When network users have various QoS requirements, the proposed multicast weight parameter is very informative for them.

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

U2 - 10.1007/11751595_114

DO - 10.1007/11751595_114

M3 - Conference contribution

AN - SCOPUS:33745881614

SN - 3540340750

SN - 9783540340751

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

SP - 1090

EP - 1099

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, Choo H. Multicast ω-trees based on statistical analysis. In Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part III. Springer Verlag. 2006. p. 1090-1099. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11751595_114

Multicast ω-trees based on statistical analysis

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this