Two multi-constrained multicast QoS routing algorithms

Multicast routing algorithms that are capable of providing quality of service (QoS) to its members will play an important role in future communications networks.In the paper,for the multi-constrained minimum Steiner tree problem, we proposed a CBT-based multi-constrained multicast routing algorithm(CMCMRA) and a SPH-based multi-constrained multicast routing algorithm(SMCMRA). Anlysis showed the algorithms are easy to implement and the time complexities are quite and simulation results illustrated the algorithms have features of well performance of cost and guarantee QoS multiple constraints efficiently.