A QoS routing algorithm based on ant algorithm

The requirements of routing due to multimedia applications are discussed. In order to solve the QoS constrained routing effectively and efficiently, we construct a globally optimizing ant algorithm, which is based on the ability of ants to find the shortest path between their nest and the food source during their search for food. Simulation results show that the proposed approach can realize QoS routing effectively and efficiently.

[1]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[2]  Léon J. M. Rothkrantz,et al.  Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..

[3]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[4]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[5]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[6]  Junzhou Luo,et al.  QoS routing based on genetic algorithm , 1999, Comput. Commun..