An Efficient Multicast Tree with Delay and Delay Variation Constraints

Lecture Notes in Computer Science, vol. 3982, pp. 1129-1136, May 2006

Moonseong Kim, Young-Cheol Bang, Jong S. Yang, and Hyunseung Choo

Abstract

With the rapid evolution of real time multimedia applications like audio/video conferencing, interactive distributed games and real time remote control system, a certain Quality of Service (QoS) needs to be guaranteed in underlying networks. Multicast routing algorithms should support the required QoS. There are two important QoS parameters, bounded delay and delay variation, that need to be guaranteed in order to support the real time multimedia applications. Here we solve Delay and delay Variation Bounded Multicast Tree (DVBMT) problem which has been proved to NP-complete. In this paper, we propose an efficient algorithm for DVBMT. The performance enhancement is up to about 21.7% in terms of delay variation as compared to the well-known algorithm, KBC [9].

Keyword

 

 

View Full Text