论文部分内容阅读
自适应层次化聚类算法将单层拓扑映射为一个层次化结构,改善了应用层多播算法的可扩展性。但它也引入了较高的根节点度数,无法有效控制多播树的形态,不适合用于多媒体等内容的多播通信。通过“剪枝重置”和“构建顶层拓扑”操作,可以弥补自适应层次化聚类算法的缺陷。仿真试验表明,前者可以减少树的层数和同一个聚类中的节点密度;后者可以减轻多播树根节点的负担。相对于采用传统路由算法得到的单层拓扑多播树,该文得到的多播树在开销、时延和度数方面都有显著的优化。
The adaptive hierarchical clustering algorithm maps the single-layer topology into a hierarchical structure, which improves the scalability of the application layer multicast algorithm. But it also introduces a higher degree of root node, can not effectively control the shape of the multicast tree, is not suitable for multimedia content such as multicast communication. Through the “pruning reset” and “build top-level topology” operation, can make up for the flaws of adaptive hierarchical clustering algorithm. The simulation results show that the former can reduce the number of trees and the density of nodes in the same cluster. The former can reduce the burden of multicast tree roots. Compared with the single layer topology multicast tree which is obtained by the traditional routing algorithm, the multicast tree obtained in this paper has significant optimization in terms of overhead, delay and degree.