The Novel Routing Algorithms Based on ACO and GAs

Abstract:

The paper proposed a novel methods in order to solve the congestion and routing oscillation, which based on crossover and mutation of the ant colony algorithm to achieve dynamic QoS routing realization. The algorithm expanded the scope of the search path selection adaptively adjust the strategy and the amount of information to determine the probability of renewal strategy, which can better adapt to dynamic network environment, you can make the shortest possible path of choice to meet the real-time applications, while avoiding link load is heavy, maintaining the distribution of network load balance. The simulation results show that the routing algorithm has better convergence speed and stability, which can more effectively address congestion and routing oscillation, its performance compared with traditional methods have been noticeably elevated, indicating it has a better multimedia network environment flexibility.

• Periodical: Advanced Materials Research (Volumes 121-122)
• Pages: 329-334
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.121-122.329
• Online since: June 2010
• Authors: Rong Hu Zhang, Shu Zhou
• Keywords: ACOGA, Path Selection, Routing Algorithm

References

[1] Lu Y, Zhao GY, Shu F J. Adaptive dynamic routing algorithm based on antalgorithm[J]. Journalof Zhejiang University, 2005, (10): 56~61.

[2] Wang Y, Xie JY Algorithm for multimedia multicast routing based on ant colony optimization[J]. Journal of Shanghai Jiaotong University, 2002, 36(4): 526~531.

[3] Maniezzo V, Carbonaro A. An ants heuristic for the frequency assignment problem. Future Generation Computer Systems, 2000, 16(8): 927~935.

DOI: 10.1016/s0167-739x(00)00046-7

[5] Wang H. M, You ZS, etl. A new modeling method based on fuzzy control using GA [J]. Journal of University of Electronic Science and Technology of China, . 2002, 31(3): 266-269 （ Chinese editon ）.

[6] . Dorigo M, Gambardela LM. Ant colony system: a cooperative learning approach to the traveling salesman problem[J]. IEEE Trans on Evolutionary Computing , 1997, 1(1): 53-56.

DOI: 10.1109/4235.585892

[7] Bi J, Fu MY, Zhang K N. An improved ant colony algorithm for the shortest path problem[J]. Computer Engineering and Applications, 2003, 3: 107~109, 35(3) : 77~81.

[8] Liu P, Gao F, Yang Y. QoS routing algorithm based on the combination of genetic algorithm and ant colony algorithm[J]. Application Research of Computers, 2007, 35(9) : 224~227.

[9] Xu G, Ma GW, Yang J. Optimal operation of cascade hydropower plants in competitive electricity market based on ant colony algorithm [J].

[10] Chen L, Shen J, etl. An adaptive ant colony algorithm based on equilibrium of Distribution [J] Journal of Software, 2003, 14(8): 1379~ 1387.