基于共享树策略的延迟受限组播路由算法

摘要

An efficient delay-constrained multicast routing algorithm based on shared tree strategy(STMA) was proposed in this paper. The running complexity of it is O(m|V|2), where m is the number of group members, |V| is the number of nodes in network. Experimental results through simulations show that STMA achieves good performance with moderate running complexity.%提出了一个有效的基于共享树策略的延迟受限组播路由算法(STMA)。算法的计算复杂性是O(m|V|2)，其中m是组成员数量，|V|是网络中节点数量。仿真结果显示，STMA在适中的复杂性水平上取得了良好的代价性能