QoS Multicast Routing Algorithm Based on QGA

Author

Chen Niansheng ; Li Layuan ; Ke Zongwu

Author_Institution

Hubei Normal Univ., Huangshi

fYear

2007

fDate

18-21 Sept. 2007

Firstpage

683

Lastpage

688

Abstract

The key problem of QoS multicast routing optimization algorithm is to build QoS constrained multicast tree. This is the most noted problem in computer networks as constrained minimum Steiner tree problem, which has also been shown as NP-complete. Quantum genetic algorithm is a new genetic algorithm based on quantum theory. A multicast routing optimization algorithm with QoS constraints based on quantum genetic algorithm (QoSMR-QGA) is proposed in this paper, and the process of routing based on QoSMR-QGA is provided. Simulation results show that the QoSMR-QGA is the satisfied astringency and dependable rate of successful routing, to conform to the QoS multicast routing requirement of large- scale network.

Keywords

computer networks; genetic algorithms; quality of service; telecommunication network routing; NP-complete problem; QoS constrained multicast tree; QoS multicast routing optimization algorithm; computer networks; constrained minimum Steiner tree problem; large-scale network; quantum genetic algorithm; quantum theory; Bandwidth; Computer science; Constraint optimization; Genetic algorithms; Jitter; Multicast algorithms; Parallel processing; Quantum computing; Quantum mechanics; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Network and Parallel Computing Workshops, 2007. NPC Workshops. IFIP International Conference on

Conference_Location

Liaoning

Print_ISBN

978-0-7695-2943-1

Type

conf

DOI

10.1109/NPC.2007.48

Filename

4351563