一种高稳定性应用层组播树构建算法  

Construction Algorithm of Application Layer Multicast Tree with High Stability

作　　者：李午阳[1] 高德远[1] 何颖[1] 高翔[1] 

机构地区：[1]西北工业大学计算机学院,西安710129

出　　处：《计算机工程》2011年第19期85-87,共3页Computer Engineering

基　　金：教育部博士点新教师基金资助项目(20070699011)

摘　　要：提出一种基于节点在线时间期望的应用层组播树构建算法(MPOT)。根据路径的在线时间期望获得节点的插入位置,节点中断后利用组播节点在线时间的重尾现象,在恢复被迫中断节点时保留节点在线时间信息,构建高稳定性组播树。同时针对断裂恢复问题,提出带一阶预测的MPOT算法。模拟结果表明,2种算法构建的组播树均具有较高的稳定性。This paper proposes a construction algorithm of Application Layer Multicast（ALM） tree based on live-time expectation.The algorithm gets insert node from calculating path-live-time expectation.According to the heavy tails conclusion of online nodes,reserve the live-time information of interrupted nodes in recovering these interrupted nodes do great help to the stability of ALM tree.Aiming at fault recovery,it proposes improved MPOT algorithm with one order prediction.Simulation result shows that the proposed algorithm has better performance compared to the other algorithms.

关 键 词：应用层组播 组播树 重尾 在线时间期望 一阶预测 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]