지연시간을 고려한 최소비용의 동적 멀티캐스트 라우팅 알고리즘 = A Distributed Low-cost Dynamic Multicast Routing Algorithm with Delay Constraints

다국어 초록 (Multilingual Abstract)

Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.