Abstract: Based on the Random Selective Tree Node First (RSTF) algorithm that constructs minimum cost multicast tree and considering the delay of the network, this paper presented a new algorithm constructing delay-constrained minimum cost multicast tree. The simulation about random network model shows that compared with KPP the new algorithm has better performance in terms of cost and time delay.

Key words: delay-constrained, the minimum cost multicast tree, random network

摘要： 在一种构造费用最小多播树算法（RSTF）的基础上，考虑了网络的时延，提出一种新的时延受限费用最小多播树算法。通过随机网络的仿真结果表明，新算法与KPP算法相比在费用、时延方面有很好的性能。

关键词: 时延受限, 费用最小多播树, 随机网络