Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) Two multi-constrained multicast QoS routing algorithms Haier International Training Center, Qingdao, China July 30-August 01 ISBN: 0-7695-2909-7
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SNPD.2007.457
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 multiconstrained 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.
Citation:
Huang Lin, Zhang Yu-Lin, Ren Yong-Hong, "Two multi-constrained multicast QoS routing algorithms," snpd, vol. 3, pp.495-500, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||