Journal of Northeastern University ›› 2008, Vol. 29 ›› Issue (2): 201-204+212.DOI: -

• OriginalPaper • Previous Articles     Next Articles

QoS multicast routing algorithm based on mind evolutionary computation and game theory

Wang, Jun-Wei (1); Wang, Xing-Wei (1); Huang, Min (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China; (2) Northeastern University at Qinhuangdao, Qinhuangdao 066004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2008-02-15 Published:2013-06-22
  • Contact: Wang, J.-W.
  • About author:-
  • Supported by:
    -

Abstract: Taking the characteristics of multi-constraint QoS (quality of service) routing in NGI (next generation Internet) into account, a QoS multicast routing algorithm based on MEC(mind evolutionary computation) and game theory is presented. It introduces the membership functions to evaluate the adaptability of candidate edges to users requirements for QoS; makes sure of whether the network provider has been in Nash equilibrium with users in respect to the utility on edges through gaming analysis; constructs a multicast routing tree via MEC so as to enable users' QoS requirements to be satisfied and the utility of both network provider and users to reach or approach Pareto optimum when both are in Nash equilibrium. Simulation results showed that the proposed algorithm is feasible and effective.

CLC Number: