On Algorithm for the Delay- and Delay Variation-Bounded Multicast Trees Based on Estimation

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.

• Type: Conference
• Year: 2005
• Where: HPCC
• Authors: Youngjin Ahn, Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
• Keywords: HPCC 2005, Multicast Technology, Real-time Group Applications, Variation-Bounded Multicast Tree