• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.33-41
• /
• 2007

With the development of the multicast technology, the realtime strategy among the group applications using the multicast routing is getting more important. An essential factor of these real-time application is to optimize the Delay- and delay Variation-Bounded Multicast Tree(DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as NP-complete problem. The representative algorithms for the problem are DVMA, DDVCA, and so on. In this paper, we show that the proposed algorithm outperforms any other algorithm. The efficiency of our algorithm is verified through the prerformance evaluation and the enhancement is up to about 9% to 29% in terms of the multicast delay variation. The time complexity of our algorithm is $O(mn^2)$M.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.105-110
• /
• 2005

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 DUVCA. The time complexity of our algorithm is $O(mn^2)$.