Multicast routing with delay constrain based on improved CSA

With the application of the good gene information in the immaturity subpopulation,the improved clonal selection algorithm which was proposed,combined the principle of minimum cost and delay constrains to modify each individual gene so as to improve population.Meanwhile,an additional memory cell of t...

Full description

Saved in:
Bibliographic Details
Main Authors: ZHANG Jing, WANG Lian-hong
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2009-01-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/74652498/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the application of the good gene information in the immaturity subpopulation,the improved clonal selection algorithm which was proposed,combined the principle of minimum cost and delay constrains to modify each individual gene so as to improve population.Meanwhile,an additional memory cell of the best individual accumulated in the process was set up to avoid population devolution.The optimized solution could be promptly searched and reached without prepared routing set.Simulation tests of multicast routing with delay constrain demonstrate that the improved clonal selection algorithm has better search efficiency,higher convergence speed,lower complexity of calculation,and better robust performance than the usual clonal selection algorithm and the genetic algorithm.
ISSN:1000-436X