Study of Path Optimization in Packet Switching Network using Neural Network

The problem of finding the optimal path between two nodes is a well known problem in network analysis. Optimal routing has been widely studied for interconnection networks this paper work considers the problem of finding the optimal path. A Genetic algorithm based strategy is proposed and the algorithm has been developed to find the Optimal Path. This paper work presents a neural network based approach to the shortest path routing problem. Weights adjustment of the neurons has been used for solving the problem of optimum path. This paper presents the back propagation algorithm to solve the problem of optimum path in multi layer feed forward (MLFF) network. Even though shortest path routing algorithms are already well established, there are researchers who are trying to find alternative methods to find shortest paths through a network. One such alternative is to use of neural network.

[1]  Chung G. Kang,et al.  Shortest path routing algorithm using Hopfield neural network , 2001 .

[2]  H.E. Rauch,et al.  Neural networks for routing communication traffic , 1988, IEEE Control Systems Magazine.

[3]  P. Souéres,et al.  Shortest paths synthesis for a car-like robot , 1996, IEEE Trans. Autom. Control..

[4]  Qing Zhu,et al.  An iterative algorithm for delay-constrained minimum-cost multicasting , 1998, TNET.

[5]  Suk-Gwon Chang.  Fair integration of routing and flow control in communication networks , 1992, IEEE Trans. Commun..

[6]  Faouzi Kamoun,et al.  Neural networks for shortest path computation and routing in computer networks , 1993, IEEE Trans. Neural Networks.

[7]  Dong-Chul Park,et al.  A neural network based multi-destination routing algorithm for communication network , 1998, 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227).

[8]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[9]  Masaharu Munetomo,et al.  A migration scheme for the genetic adaptive routing algorithm , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[10]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[11]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[12]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[13]  Yee Leung,et al.  A genetic algorithm for the multiple destination routing problems , 1998, IEEE Trans. Evol. Comput..

[14]  Pawel Gburzynski,et al.  Routing in multihop packet switching networks: Gb/s challenge , 1995, IEEE Netw..