Clone selection based multicast routing algorithm

Authors:
Cuiqin Hou;Licheng Jiao;Maoguo Gong;Bin Lu
Affiliations:
Institute of Intelligent Information Processing, Xidian University, Xi'an, P.R. China;Institute of Intelligent Information Processing, Xidian University, Xi'an, P.R. China;Institute of Intelligent Information Processing, Xidian University, Xi'an, P.R. China;Institute of Intelligent Information Processing, Xidian University, Xi'an, P.R. China
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Year:
2005

Citing 5
Cited 0

Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
An iterative algorithm for delay-constrained minimum-cost multicasting

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An orthogonal genetic algorithm for multimedia multicast routing

IEEE Transactions on Evolutionary Computation
Evaluation of multicast routing algorithms for real-time communication on high-speed networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of multicast routing with delay constraints is of great interest in the communication area in the last few years and has been proved a NP-Complete problem. A novel multicast routing algorithm based on clone selection operator is proposed to solve the problem. Simulations illustrate that compared with other algorithms, the proposed algorithm has a fast convergence speed and powerful search ability. The result shows that the proposed algorithm can find a better solution in the same time or even the shorter time.