一种改进的组播树主动重建方案研究

计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (7): 19-22.

一种改进的组播树主动重建方案研究

刘世栋,张顺颐

南京邮电大学信息网络技术研究所，南京 210003

收稿日期:2007-10-24 修回日期:2007-12-12 出版日期:2008-03-01 发布日期:2008-03-01
通讯作者: 刘世栋

Improved reconstruction scheme for application multicast tree

LIU Shi-dong,ZHANG Shun-yi

Institute of Information Network Technology，Nanjing University of Posts and Telecommunications，Nanjing 210003，China

Received:2007-10-24 Revised:2007-12-12 Online:2008-03-01 Published:2008-03-01
Contact: LIU Shi-dong

摘要/Abstract

摘要： 应用层组播树的主动恢复方案具有比被动恢复方案更小的恢复时延。针对proactive方案只能满足节点连接度限制的不足提出了一种QOS有保证的主动树恢复方案—DDCP。在满足节点连接度限制的同时，保证了端用户的时延性能。与之对应提出了一种预留节点度的初始组播树构建方案。DDCP方案不论是从组播树的恢复时延、重构树的质量还是用于树重建的控制负荷方面考虑，都比其它方案有一定程度的改进，模拟实验证明了这一点。

Abstract: Proactive scheme have a shorter recovering time than reactive approach.In this paper a modified delay and degree-constrained scheme named DDCP is proposed.Compared with previous one，the new approach ensures the delay requirement is satisfied while the degree constraint is not violated.At the same time a degree pre-reserved initial tree-construction algorithm is also put forward to improve the efficiency of DDCP.Whatever the responsiveness of the recovery process，the quality of the restored tree or the recovery overhead DDCP have improved to some extent.Simulation tests proved it.

刘世栋,张顺颐. 一种改进的组播树主动重建方案研究[J]. 计算机工程与应用, 2008, 44(7): 19-22.

LIU Shi-dong,ZHANG Shun-yi. Improved reconstruction scheme for application multicast tree[J]. Computer Engineering and Applications, 2008, 44(7): 19-22.