高效的基于平面的层次化应用层组播树模型

Efficient Plane-based Hierarchical Application Layer Multicast Model

应用层组播在Internet上有着广泛的应用。本文在K-叉树结构的基础上提出了一种K-叉平面结构,同时在平面的组织上结合了分层和分簇的思想。K-叉平面结构降低了子树之间的错误关联度;分层分簇降低了组播树的深度,减少了组播管理上的复杂度;在增加一定冗余的前提下,不同平面的簇与簇之间采用小概率通信,提高了数据恢复和数据传递的效率。整体而言,组播树的健壮性得到了很好的保证。仿真实验结果证明本模型能够很好地对端用户进行管理,提高了因某些结点意外失效造成的数据恢复和应用层组播的转发效率。

Application Layer Multicast has been widely used recently. This paper proposes a K-plane construction which is based on K-tree, and uses the thought of hierarchies and clusters in planes organization. K-plane reduces the relation between sub-trees; hierarchies and clusters reduce the depth of the tree and the complexity of multicast in organization; giving the condition of adding some redundancy, different plane＇s clusters communicate with each other in probability of p, which improves data recovery and the efficiency of data delivery. By all accounts, the multicast tree robustness is well assured. Simulation experiment proves the model can organize the terminal users well, improve data recovery and increase the forwarding efficiency of ALM.