Title :
A Multiple QoS Anycast Routing Algorithm Based Adaptive Genetic Algorithm
Author :
Li Taoshen ; Ge Zhihui
Author_Institution :
Sch. of Comput., Electron. & Inf., Guangxi Univ., Nanning, China
Abstract :
The anycast is a new network addressing and routing scheme, and has been defined as a standard communication model in IPv6. By analyzing the characters of anycast service, an anycast routing model with multiple QoS constraints and a felicitous estimate function of the optimal route path are presented in this paper, and a multiple QoS anycast routing algorithm based adaptive genetic algorithm is proposed. This algorithm uses adaptive probabilities of crossover and mutation to solve the problem of computing probabilities of crossover and mutation over and over again in simple genetic algorithm. Using fitness scaling can guarantee the diversity of populations in process of running, and is beneficial to global optimal solution. The results of network experiment show that this algorithm is effective and available. It can satisfy the constrained condition of multiple QoS, balance network load fairly, and improve the quality of network service.
Keywords :
genetic algorithms; quality of service; telecommunication network routing; IPv6; adaptive genetic algorithm; multiple QoS anycast routing algorithm; multiple QoS constraints; optimal route path; quality of network service; Algorithm design and analysis; Bandwidth; Communication standards; Computer networks; Costs; Genetic algorithms; Genetic mutations; Network servers; Quality of service; Routing; Quality of Service(QoS); adaptive genetic algorithm; anycast; load balance; routing algorithm;
Conference_Titel :
Genetic and Evolutionary Computing, 2009. WGEC '09. 3rd International Conference on
Conference_Location :
Guilin
Print_ISBN :
978-0-7695-3899-0
DOI :
10.1109/WGEC.2009.148