Quantum Clonal Algorithm for Multicast Routing Problem
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The bounded shortest multicast algorithm(BSMA)is believed the best constrained multicast algorithm. However,the large computation time restricts its application.As a global optimizing algorithm,genetic algorithm (GA)is applied to solve the problem of multicast more and more.GA has more powerful searching ability than traditional algorithm,however its property of"prematurity"makes it difficult to get a good multicast tree.A quantum clonal algorithm(QCA)to deal with multicast routing problem is presented in this paper,which saliently solves the"prematurity"problem in Genetic based multicast algorithm.Furthermore,the algorithm is accelerated by using quantum crossover.The algorithm has the property of simple realization and flexible control.The simulation results show that QCA has a better performance than BSMA and traditional GA.

    Reference
    Related
    Cited by
Get Citation

李阳阳,焦李成.量子克隆多播路由算法.软件学报,2007,18(9):2063-2069

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 01,2006
  • Revised:January 24,2007
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063