Nature inspired artificial intelligence based adaptive traffic flow distribution in computer network

Because of the stochastic nature of traffic requirement matrix, it is very difficult to get the optimal traffic distribution to minimize the delay even with adaptive routing protocol in a fixed connection network where capacity already defined for each link. Hence there is a requirement to define such a method, which could generate the optimal solution very quickly and efficiently. This paper presenting a new concept to provide the adaptive optimal traffic distribution for dynamic condition of traffic matrix using nature based intelligence methods. With the defined load and fixed capacity of links, average delay for packet has minimized with various variations of evolutionary programming and particle swarm optimization. Comparative study has given over their performance in terms of converging speed. Universal approximation capability, the key feature of feed forward neural network has applied to predict the flow distribution on each link to minimize the average delay for a total load available at present on the network. For any variation in the total load, the new flow distribution can be generated by neural network immediately, which could generate minimum delay in the network. With the inclusion of this information, performance of routing protocol will be improved very much.

[1]  Yoonseon Song,et al.  Evolutionary programming using the Levy probability distribution , 1999 .

[2]  Masaharu Munetomo,et al.  Designing a distributed algorithm for bandwidth allocation with a genetic algorithm , 2004 .

[3]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

[4]  Samuel Pierre,et al.  An Artificial Intelligence Approach to Improving Computer Communications Network Topologies , 1990 .

[5]  Tarek M. Mahmoud A Genetic and Simulated Annealing Based Algorithms for Solving the Flow Assignment Problem in Computer Networks , 2007 .

[6]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[7]  Abdullah Konak,et al.  Designing resilient networks using a hybrid genetic algorithm approach , 2005, GECCO '05.

[8]  Vincent K. N. Lau,et al.  A genetic algorithm based approach to route selection and capacity flow assignment , 2003, Comput. Commun..

[9]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[10]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[11]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[12]  Parviz Kermani,et al.  MENTOR: an algorithm for mesh network topological optimization and routing , 1991, IEEE Trans. Commun..

[13]  Victor O. K. Li,et al.  Flow assignment and packet scheduling for multipath routing , 2003, Journal of Communications and Networks.