Efficient Algorithm for Reducing Delay Variation on Bounded Multicast Trees

Springer-Verlag Lecture Notes in Computer Science, vol. 3090, pp. 440-450, Sep. 2004 (SCI)

Moonseong Kim, Young-Cheol Bang, and Hyunseung Choo

Abstract

With the proliferation of multimedia group applications, the construction of multicast trees satisfying QoS requirements is becoming a problem of prime importance. In this paper, we study the delay- and delay variation-bounded multicast tree (DVBMT) problem which is NP-complete. The problem is to construct a spanning tree for destination node, which has the minimized multicast delay variation, and the delay on the path from the source to each destination is bounded. 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 the proposed scheme outperforms DDVCA which is known to be effective so far in any network topology. The enhancement is up to about 3.6%~11.1% in terms of normalized surcharge for DDVCA. The time complexity of our algorithm is O(mn 2).

 

Keyword

 

 

View Full Text