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). © IFIP International Federation for Information Processing 2004.
CITATION STYLE
Kim, M., Bang, Y. C., & Choo, H. (2004). 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), 3042, 200–210. https://doi.org/10.1007/978-3-540-24693-0_17
Mendeley helps you to discover research relevant for your work.