Multicast Routing Algorithm on the High Performance Computer Network

The study of the multicast routing protocol of multi-constrained is important for the development of the high performance network. The aims are the multi-constrained network model and the definition of the formula of every constrained characteristic measurement. However, it is a NP-complete problem. In order to gain the approximative solution, many heuristic algorithms have been designed by filling all kind of constraints. A few kind of classical routing algorithms at the optimization aspect have been analyzed and compared. The question has been pointed out in the protocol study.