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.
Unable to display preview. Download preview PDF.
- 3.Rouskas, G.N., Baldine, I.: Multicast routing with end-to-end delay and delay variation constraints. IEEE J-SAC 15(3), 346–356 (1997)Google Scholar
- 4.Sheu, P.-R., Chen, S.-T.: A fast and efficient heuristic algorithm for the delay- and delay variation bound multicast tree problem. In: Proc. ICOIN-15 Information Networking, January 2001, pp. 611–618 (2001)Google Scholar