A QoS Routing Algorithm Based on Culture-Ant Colony Algorithm
QoS routing problem is a typical nonlinear combination optimization problem, which has been proved to be a NP complete problem. According to the defects of solving the problem by Ant Colony Algorithms (ACA), a QoS routing algorithm based on Culture-Ant Colony Algorithms is put forward in this paper. Bringing ACA into the framework of Culture Algorithms, the algorithm adopts the two evolution frame (the population space and the belief space) to draw and manage the evolution information effectively, and instructs the routing process of ant colony in the population space by using that information. The simulation indicates the algorithm receives a satisfactory result for the convergence speed and global searching capability are both advanced to a great extent.
routing culture algorithms ant colony algorithms quality of service(QoS)
Ming-Wei Zhang Xue-Mei Sun Xiao-Yu Lv
College of Computer, Tianjin Polytechnic University, Tianjin, China, 300160
国际会议
太原
英文
198-201
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）