On core selection algorithm for reducing delay variation of many-to-many multicasts with delay-bounds

Moonseong Kim; Young Cheol Bang; Hyunseung Choo

doi:10.1007/978-3-540-24693-0_17

On core selection algorithm for reducing delay variation of many-to-many multicasts with delay-bounds

Moonseong Kim
, Young Cheol Bang
, Hyunseung Choo

Department of Computer Science and Engineering

Sungkyunkwan University
Tech University of Korea

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

7 Scopus citations

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. In this paper, we study the core selection problem that should produce the improved delay-bounded multicast tree in terms of the delay variation that is known to be NP-complete [8]. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that our proposed scheme outperforms that of DDVCA [18] that is known to be most effective so far in any network topology. The enhancement is up to about 11.1% in terms of normalized surcharge for DDVCA. The time complexity of our algorithm is O(mn²).

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Nikolas Mitrou, Kimon Kontovasilis, George N. Rouskas, Ilias lliadis, Lazaros Merakos
Publisher	Springer Verlag
Pages	200-210
Number of pages	11
ISBN (Print)	9783540246930
DOIs	https://doi.org/10.1007/978-3-540-24693-0_17
State	Published - 2004

Publication series

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

Access to Document

10.1007/978-3-540-24693-0_17

Cite this

Kim, M., Bang, Y. C., & Choo, H. (2004). On core selection algorithm for reducing delay variation of many-to-many multicasts with delay-bounds. In N. Mitrou, K. Kontovasilis, G. N. Rouskas, I. lliadis, & L. Merakos (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 200-210). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3042). Springer Verlag. https://doi.org/10.1007/978-3-540-24693-0_17

Kim, Moonseong ; Bang, Young Cheol ; Choo, Hyunseung. / On core selection algorithm for reducing delay variation of many-to-many multicasts with delay-bounds. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Nikolas Mitrou ; Kimon Kontovasilis ; George N. Rouskas ; Ilias lliadis ; Lazaros Merakos. Springer Verlag, 2004. pp. 200-210 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{a8b6b1e3d4d145ffb70285f40fcb9f4f,

title = "On core selection algorithm for reducing delay variation of many-to-many multicasts with delay-bounds",

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. In this paper, we study the core selection problem that should produce the improved delay-bounded multicast tree in terms of the delay variation that is known to be NP-complete [8]. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that our proposed scheme outperforms that of DDVCA [18] that is known to be most effective so far in any network topology. The enhancement is up to about 11.1\% in terms of normalized surcharge for DDVCA. The time complexity of our algorithm is O(mn2).",

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

year = "2004",

doi = "10.1007/978-3-540-24693-0\_17",

language = "English",

isbn = "9783540246930",

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

publisher = "Springer Verlag",

pages = "200--210",

editor = "Nikolas Mitrou and Kimon Kontovasilis and Rouskas, \{George N.\} and Ilias lliadis and Lazaros Merakos",

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

}

Kim, M, Bang, YC & Choo, H 2004, On core selection algorithm for reducing delay variation of many-to-many multicasts with delay-bounds. in N Mitrou, K Kontovasilis, GN Rouskas, I lliadis & L Merakos (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3042, Springer Verlag, pp. 200-210. https://doi.org/10.1007/978-3-540-24693-0_17

On core selection algorithm for reducing delay variation of many-to-many multicasts with delay-bounds. / Kim, Moonseong; Bang, Young Cheol; Choo, Hyunseung.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Nikolas Mitrou; Kimon Kontovasilis; George N. Rouskas; Ilias lliadis; Lazaros Merakos. Springer Verlag, 2004. p. 200-210 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3042).

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

TY - CHAP

T1 - On core selection algorithm for reducing delay variation of many-to-many multicasts with delay-bounds

AU - Kim, Moonseong

AU - Bang, Young Cheol

AU - Choo, Hyunseung

PY - 2004

Y1 - 2004

N2 - 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. In this paper, we study the core selection problem that should produce the improved delay-bounded multicast tree in terms of the delay variation that is known to be NP-complete [8]. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that our proposed scheme outperforms that of DDVCA [18] that is known to be most effective so far in any network topology. The enhancement is up to about 11.1% in terms of normalized surcharge for DDVCA. The time complexity of our algorithm is O(mn2).

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. In this paper, we study the core selection problem that should produce the improved delay-bounded multicast tree in terms of the delay variation that is known to be NP-complete [8]. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that our proposed scheme outperforms that of DDVCA [18] that is known to be most effective so far in any network topology. The enhancement is up to about 11.1% in terms of normalized surcharge for DDVCA. The time complexity of our algorithm is O(mn2).

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

U2 - 10.1007/978-3-540-24693-0_17

DO - 10.1007/978-3-540-24693-0_17

M3 - Chapter

AN - SCOPUS:35048895265

SN - 9783540246930

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

SP - 200

EP - 210

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

A2 - Mitrou, Nikolas

A2 - Kontovasilis, Kimon

A2 - Rouskas, George N.

A2 - lliadis, Ilias

A2 - Merakos, Lazaros

PB - Springer Verlag

ER -

Kim M, Bang YC, Choo H. On core selection algorithm for reducing delay variation of many-to-many multicasts with delay-bounds. In Mitrou N, Kontovasilis K, Rouskas GN, lliadis I, Merakos L, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 200-210. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-24693-0_17

On core selection algorithm for reducing delay variation of many-to-many multicasts with delay-bounds

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this