With the proliferation of multimedia group applications, the construction of multicast trees satisfying the Quality of Service (QoS) requirements is becoming a problem of the prime importance. 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 performance evaluation and the enhancement is up to about 13.5% in terms of the multicast delay variation. The time complexity of our algorithm is O(mn2) which is comparable to well known DDVCA.

This paper compared the approaches concerning the pinball routing problem that occurs in the nested network in network mobility environment and developed the analytic framework to model. Each model was evaluated of transmission latency, memory usage, and BU's occurrence number at routing optimization process. The estimation result showed that the optimization mechanism achievement overhead existed in each model, and the full optimization of the specific model was not attained because of it. Therefore, the most appropriate approach for routing optimization in nested NEMO can be determined only after a careful evaluation, and the proposals must consider using it in combination with other approaches. The modeling framework presented in this paper is intended to quantity the relative merits and demerits of the various approaches.