loading...
A PACA-Based Multicast Routing Algorithm
Haier International Training Center, Qingdao, China July 30-August 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SNPD.2007.71Eighth ACIS International Conference ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ziqiang Wang, Henan University of Technology, China
Xia Sun, Henan University of Technology, China
Dexian Zhang, Henan University of Technology, China
Multicast routing arises in many multimedia communication applications such as videos conference, remote education, CSCW and so on. In order to resolve Qos multicast routing effectively and efficiently, this paper mainly studied the bandwidth-delay- constrained least-cost multicast routing problem, and present a parallel ant colony algorithm (PACA) to solve the problem. The simulation results show that this algorithm is an efficient algorithm.
Citation:
Ziqiang Wang, Xia Sun, Dexian Zhang, "A PACA-Based Multicast Routing Algorithm," snpd, vol. 2, pp.636-639, 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.