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

An efficient delay-constrained multicast routing algorithm based on shared tree strategy

作　　者：樊秀梅[1] 张宝贤[1] 刘越[1] 陈常嘉[1] 

机构地区：[1]北方交通大学通信与信息工程系,北京100044

出　　处：《铁道学报》2001年第2期41-44,共4页Journal of the China Railway Society

摘　　要：提出了一个有效的基于共享树策略的延迟受限组播路由算法 (STMA)。算法的计算复杂性是O(m|V|2 ) ,其中 m是组成员数量 ,|V|是网络中节点数量。仿真结果显示 ,STMA在适中的复杂性水平上取得了良好的代价性能。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.

关 键 词：网络路由算法 延迟受限组播路由算法 共享树策略 计算机 

分 类 号：TN919.1[电子电信—通信与信息系统]