DocumentCode :
2473347
Title :
Improving orchestra using distributed parallel genetic algorithm
Author :
Peng, Yong-Xiang ; Zhan, Si-Yu ; Lu, Xian-Liang
Author_Institution :
Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
fYear :
2010
fDate :
17-19 Dec. 2010
Firstpage :
48
Lastpage :
51
Abstract :
Orchestra is proposed to change the traditional design process of routing protocols and it firstly introduces the concept of evolution into routing design. The disadvantage of traditional genetic algorithm, such as the bad searching quality and long computation time, makes the Orchestra has a bad performance and can not be applied to large scale network routing design. To improve Orchestra, a distributed parallel genetic algorithm is proposed. It adopts the improved genetic simulated annealing algorithm and uses distributed parallel technique to implement the distributed computing. With the distributed parallel genetic algorithm, the Orchestra will be more practical.
Keywords :
computer networks; genetic algorithms; parallel algorithms; parallel architectures; routing protocols; search problems; simulated annealing; Orchestra; computation time; design process; distributed computing; distributed parallel genetic algorithm; distributed parallel technique; genetic simulated annealing algorithm; large scale network routing design; routing protocols; searching quality; Algorithm design and analysis; Computational modeling; Gallium; Routing; Routing protocols; Simulated annealing; Parallel Genetic Algorithm; Routing design; simulated annealing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Apperceiving Computing and Intelligence Analysis (ICACIA), 2010 International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-8025-8
Type :
conf
DOI :
10.1109/ICACIA.2010.5709848
Filename :
5709848
Link To Document :
بازگشت