作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (19): 85-87. doi: 10.3969/j.issn.1000-3428.2011.19.027

• 网络与通信 • 上一篇    下一篇

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

李午阳,高德远,何 颖,高 翔   

  1. (西北工业大学计算机学院,西安 710129)
  • 收稿日期:2011-03-21 出版日期:2011-10-05 发布日期:2011-10-05
  • 作者简介:李午阳(1987-),男,硕士研究生,主研方向:网络与信息安全;高德远,教授、博士生导师;何 颖,硕士;高 翔, 副教授
  • 基金资助:
    教育部博士点新教师基金资助项目(20070699011)

Construction Algorithm of Application Layer Multicast Tree with High Stability

LI Wu-yang, GAO De-yuan, HE Ying, GAO Xiang   

  1. (College of Computer Science and Technology, Northwestern Polytechnical University, Xi’an 710129, China)
  • Received:2011-03-21 Online:2011-10-05 Published:2011-10-05

摘要: 提出一种基于节点在线时间期望的应用层组播树构建算法(MPOT)。根据路径的在线时间期望获得节点的插入位置,节点中断后利用组播节点在线时间的重尾现象,在恢复被迫中断节点时保留节点在线时间信息,构建高稳定性组播树。同时针对断裂恢复问题,提出带一阶预测的MPOT算法。模拟结果表明,2种算法构建的组播树均具有较高的稳定性。

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

Abstract: 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.

Key words: Application Layer Multicast(ALM), multicast tree, heavy tails, live time expectation, one order prediction

中图分类号: