Journal of Northeastern University ›› 2006, Vol. 27 ›› Issue (6): 635-638.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Procession-competition evolutionary QoS multicast routing algorithm in NGI

Wang, Xing-Wei (1); Ren, Wei (1); Yi, Xiu-Shuang (2); Huang, Min (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China; (2) Computing Center, Northeastern University, Shenyang 110004, China
  • Received:2013-06-23 Revised:2013-06-23 Online:2006-06-15 Published:2013-06-23
  • Contact: Wang, X.-W.
  • About author:-
  • Supported by:
    -

Abstract: A non-NP QoS multicast routing algorithm in NGI (next generation Internet) is proposed. Aiming at the minimized cost, the algorithm is based on the procession-competition evolutionary algorithm to find a multicast routing tree involving the branches to constrain delay, delay jitter, bandwidth, error-rate in association with cost optimization, thus solving integrally the problem to assign routing and wavelength in a single process with network load balancing also taken into account. Simulation results showed that the proposed algorithm is feasible and effective and meets QoS requirements. In addition, it is evidently superior to the conventional QoS multicast routing algorithms based on classical genetic algorithm in cost of multicast routing tree and running time.

CLC Number: