|
|||||
|
|
| 基于子树受限QoS的组播路由恢复算法 | |
| 引用本文： | 刘芳,张明龙,万筱钟.基于子树受限QoS的组播路由恢复算法[J].西安石油大学学报(自然科学版),2007,22(5):86-89,115. |
| 作者姓名： | 刘芳 张明龙 万筱钟 |
| 作者单位： | 1. 西安石油大学,理学院,陕西,西安,710065 2. 西安交通大学,电子与信息工程学院,陕西,西安,710049 3. 西北电网有限公司,陕西,西安,710048 |
| 基金项目： | 国家高技术研究发展计划(863计划) |
| 摘 要： | 通过对多媒体组播协议的研究,发现在组播树中的路由节点发生故障后,树中节点将分散为若干个不同QoS需求的子树,通常的做法是将子树的所有节点重新发起构造成新的组播树.通过增加对子树受限QoS信息的描述,在组播树中路由节点发生故障之后,只是按照子树的QoS信息重新构造新组播树,子树构造不成功时才进行所有节点的构造.仿真试验表明,在路由节点故障情况下子树的构造成功率平均超过80%,同时这种方可缩短组播树故障恢复时间并降低重构开销.该算法还可以提高组播应用的可靠性. |
| 关 键 词： | 组播路由 受限QoS 组播树重构 算法 多媒体组播协议 |
| 文章编号： | 1673-064X（2007）05-0086-04 |
| 修稿时间： | 2007-01-10 |
An algorithm for recovering multicast routing based on the bounded QoS of subtree |
|
| LIU Fang,ZHANG Ming-long,WAN Xiao-zhong.An algorithm for recovering multicast routing based on the bounded QoS of subtree[J].Journal of Xian Shiyou University,2007,22(5):86-89,115. | |
| Authors: | LIU Fang ZHANG Ming-long WAN Xiao-zhong |
| Abstract: | It is found that multicast tree will be divided into some subtrees with different QoS demands after a routing node in the multicast tree goes wrong.Usual treatment method is that all the nodes in the subtrees of the node at fault are used for reconstructing a new multicast tree.In this paper,an algorithm is proposed,by which the subtrees can fast be connected into a new multicast tree according to the QoS information of the subtrees after a routing node goes wrong at fault.Only if this connection fails,are all the nodes in the subtrees used for reconstructing the new multicast tree.The results of the simulation tests show that the success ratio of this connection can be higher than 80%.In addition,the algorithm can shorten the recovery time of the multicast tree and decrease the expense of recovering the multicast tree.It can increase the reliability of the system as well. |
| Keywords: | multicast routing bounded QoS reconstruct of multicast tree algorithm multimedia multicast protocol |
| 本文献已被 维普 万方数据 等数据库收录！ | |