| 基于共享树策略的延迟受限组播路由算法 |
| |
| 引用本文： | 樊秀梅,张宝贤,刘越,陈常嘉. 基于共享树策略的延迟受限组播路由算法[J]. 铁道学报, 2001, 23(2): 41-44 |
| |
| 作者姓名： | 樊秀梅 张宝贤 刘越 陈常嘉 |
| |
| 作者单位： | 北方交通大学 通信与信息工程系, |
| |
| 摘 要： | 提出了一个有效的基于共享树策略的延迟受限组播路由算法（STMA），算法的计算复杂性是O（m|V|^2)，其中m是组成员数量，|V|是网络中节点数量，仿真结果显示，STMA在适中的复杂性水平上取得了良好的代价性能。
|
| 关 键 词： | 网络路由算法 延迟受限组播路由算法 共享树策略 计算机 |
| 文章编号： | 1001-8360(2001)02-0041-04 |
An efficient delay-constrained multicast routingalgorithm based on shared tree strategy |
| |
| FAN Xiu-mei,ZHANG Bao-xian,LIU Yue,CHEN Chang-jia. An efficient delay-constrained multicast routingalgorithm based on shared tree strategy[J]. Journal of the China railway Society, 2001, 23(2): 41-44 |
| |
| Authors: | FAN Xiu-mei ZHANG Bao-xian LIU Yue CHEN Chang-jia |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 维普 万方数据 等数据库收录！ |
