Lecture Notes in Computer Science, vol. 3726, pp. 117-122, 21-23 Sep. 2005 (SCI, IF 0.402)
Moonseong Kim, Young-Cheol Bang, and Hyunseung Choo
The core-based multicast routing protocol plays a significant role in many multimedia applications such as video-conferencing, replicated database updating and querying, and etc. However, existing core-based multicast routing protocols construct only the shortest paths between the core and the members in a multicast group without optimizing the quality of service requirements. In this paper, we propose an efficient algorithm for multicast delay variations and tree cost. The efficiency of our algorithm is verified through the performance evaluation and the enhancements are up to about 2.5% ~ 4.5% and 3.8% ~ 15.5% in terms of the multicast delay variation and the tree cost, respectively. The time complexity of our algorithm is O(m(l + n log n)).