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 multicast 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 multicast 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 multicast tree. Simulation experiments show that multicast 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.
