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

Authors:
Youngjin Ahn;Moonseong Kim;Young-Cheol Bang;Hyunseung Choo
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;Department of Computer Engineering, Korea Polytechnic University, Gyeonggi-Do, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Year:
2005

Citing 2
Cited 1

A Fast and Efficient Heuristic Algorithm for the Delay- and Delay Variation Bound Multicast Tree Problem

ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications

A heuristic algorithm for core selection in multicast routing

Journal of Computer Science and Technology - Special issue on Natural Language Processing

Quantified Score

Hi-index	0.00

Visualization

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.