• DocumentCode
    2008888
  • Title

    Hybrid of Genetic Algorithm and Particle Swarm Optimization for Multicast QoS Routing

  • Author

    Li, Changbing ; Cao, Changxiu ; Li, Yinguo ; Yu, Yibin

  • Author_Institution
    Chongqing Univ., Chongqing
  • fYear
    2007
  • fDate
    May 30 2007-June 1 2007
  • Firstpage
    2355
  • Lastpage
    2359
  • Abstract
    Multicast routing is an effective way to communicate among multiple hosts in a network. For multimedia applications, the routing algorithms should consider many Quality of Service (QoS) parameters such as delay, cost and so on to find a new route. However, to find routes with two or more QoS parameters is an NP-hard problem. This paper describes a new evolutionary scheme for optimization of multicast QoS routing based on the hybrid of Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), called HGAPSO. In HGAPSO, individuals in a new generation are created, not only by crossover and mutation operation as in GA, but also by PSO. The upper-half of the best-performing individuals in a population are regarded as elites. Instead of being reproduced directly to the next generation, these elites are first enhanced. The group constituted by the elites is regarded as a swarm, and each elite corresponds to a particle within it. In this regard, the elites are enhanced by PSO, an operation which mimics the maturing phenomenon in nature. This scheme can simultaneously optimize the cost of the tree, the maximum end-to-end delay, the average delay and the maximum link utilization. In this way, a set of optimal solutions, known as Pareto set, is calculated in only one run, without a priori restrictions. It has revealed an efficient method of the reconstruction of multicast tree topology and the experimental results demonstrated better performance than the conventional GA optimization method.
  • Keywords
    Pareto optimisation; genetic algorithms; multicast communication; particle swarm optimisation; quality of service; set theory; telecommunication network routing; telecommunication network topology; trees (mathematics); NP-hard problem; Pareto set; evolutionary scheme; genetic algorithm; multicast QoS routing; multicast tree topology; multimedia application; optimization; particle swarm optimization; quality of service; Cost function; Delay; Genetic algorithms; Genetic mutations; Multicast algorithms; NP-hard problem; Particle swarm optimization; Quality of service; Routing; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Automation, 2007. ICCA 2007. IEEE International Conference on
  • Conference_Location
    Guangzhou
  • Print_ISBN
    978-1-4244-0818-4
  • Electronic_ISBN
    978-1-4244-0818-4
  • Type

    conf

  • DOI
    10.1109/ICCA.2007.4376782
  • Filename
    4376782