中文摘要：

在数据交换网络中,颜色树是一种通过节点不相交的多路径路由数据报文的有效方法。这种方法中组建两棵以某一节点为根节点的颜色树,即Red树和Blue树,网络中各节点到根节点的路径是节点不相交的。本文在分析和研究SimCT算法的基础上,提出了一种基于颜色树的多播树生成方法及单节点/链路故障的多播通信恢复方案。该方法根据SimCT算法构造的颜色树来组建一棵多播转发树,在多播树中单节点或单链路故障后,故障检测节点本地执行故障恢复方案,将受影响的故障节点的下游子树重新连接到多播树。仿真实验表明,本文所提出的多播树生成方案相比现有方案可以减少网络资源的浪费,并且故障恢复后的代价与原多播通信树相当。

英文摘要：

In packet-switched networks, colored tree is an efficient approach to route packets along node-disjoint multipath. In this approach, two trees, namely Red and Blue tree, are built rooted at one node such that the path from other nodes in the network to the root is node-disjoint. From analysis and research of the SimCT algorithm, we propose a scheme of multieast tree construction and fault recovery in single node/link failure based on colored tree. In this scheme, colored tree is built firstly based on SimCT, then muhieast forward tree can be constructed along the colored tree path, and if a single node or single link is failure, fault detected nodes execute the fault recovery scheme by local information, by which the affected nodes in the downstream of failure node/link will be reassembled on the muhicast tree. Simulation experiments show that muhicast tree construction of our scheme is less overhead compared to the exist methods, and after recovery, the cost of multicast tree is consistent with the former multicast communication tree.