Multicast Routing Algorithms And Fault-tolerant Multicast Research

The core of multicast communication researches on the Internet is how to generate optimized multicast tree. Efficient multicast routing algorithms and protocols are needed. This dissertation introduced many kinds of routing algorithms and protocols, also with the algorithm performance analyses together. In this dissertation, algorithms for generating multicast trees with a trade-off in delay and bandwidth consumption are investigated. The Ameliorated Shortest Path Tree (ASPT) is proposed. The ASPT algorithm minimizes bandwidth consumption. Simulation experiment demonstrates that ASPT algorithm reduces bandwidth consumption greatly with path length increasing a little. In addition, The Restricted Search RS algorithm (RSRS) is proposed based on RS algorithm. It can reduce the time complexity of RS algorithm, at the same time, it guarantee the multicast tree is optimization. Nowadays most of researches on the multicast routing are how to generate multicast tree. In case of multicast tree failure, there need to re-route all of nodes behind the failure point so much as re-build the whole tree, this will deteriorate Quality-of-Service, on the other hand, it is insufferable in some multicast applications. We proposed a Fault-Tolerant multicast scheme to resolve this problem. Our scheme creates backup paths crosswise in the ramose node. It can reduce additional cost greatly and recover the failure of multicast tree rapidly. At the same time, the multicast tree has tiny change.