Call for Paper - August 2019 Edition
IJCA solicits original research papers for the August 2019 Edition. Last date of manuscript submission is July 20, 2019. Read More

Study of Path Optimization in Packet Switching Network using Neural Network

Print
PDF
IJCA Special Issue on Issues and Challenges in Networking, Intelligence and Computing Technologies
© 2012 by IJCA Journal
ICNICT - Number 1
Year of Publication: 2012
Authors:
Zaiba Ishrat
Sarvesh Kumar Sharma

Zaiba Ishrat and Sarvesh Kumar Sharma. Article: Study of Path Optimization in Packet Switching Network using Neural Network. IJCA Special Issue on Issues and Challenges in Networking, Intelligence and Computing Technologies ICNICT(1):23-25, November 2012. Full text available. BibTeX

@article{key:article,
	author = {Zaiba Ishrat and Sarvesh Kumar Sharma},
	title = {Article: Study of Path Optimization in Packet Switching Network using Neural Network},
	journal = {IJCA Special Issue on Issues and Challenges in Networking, Intelligence and Computing Technologies},
	year = {2012},
	volume = {ICNICT},
	number = {1},
	pages = {23-25},
	month = {November},
	note = {Full text available}
}

Abstract

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.

References

  • E. W. Dijkstra, "A note on two papers in connection with graphs," Numeriske Mathematics 1 pp. 269-271 1959.
  • D. Eppstein, "Finding the k shortest paths," SIAM journal on Computing 28(2) pp. 653-674 1998.
  • R. W Floyd, "Algorithm97: Shortest paths, "Communications of the ACM 5 pp. 345-357 1962.
  • Baransel C,Dobosiewicz W, Gburzynski p, "Routing in multihop packet switching networks:Gb/s challenges,"IEEE Network 9(3) pp. 38-61 1995.
  • Suk-Gwon C, "Fair integration of routing and flow control in communication networks,"IEEE Trans Commun 40(4) pp. 821-34 1992.
  • K. B. Kumar and J. Jaffe, "Routing to multiple destinations in computer networks", IEEE Transactions on Communications, vol. 31,no. 3, pp. 343-351, 1983.
  • M. K. Ali and F. Kamoun, "Neural networks for shortest path computation and routing in computer networks," IEEE Trans. Neural Networks, vol. 4, pp. 941-954, Nov. 1993.
  • D. C. Park and S. E. Choi, "A neural network based multi-destination routing algorithm for communication network," in Proc. Joint Conf. Neural Networks, 1998, pp. 1673-1678.
  • C. W. Ahn, R. S. Ramakrishna, C. G. Rang, and I. C. Choi, "Shortest path routing algorithm using hopfield neural neural network," Electron. Lett. , vol. 37, no. 19, pp. 1176-1178, Sept. 2001.
  • M. Munemoto, Y. Takai, and Y. Sato, "A migration scheme for the genetic adaptive routing algorithm," in Proc. IEEE Int. Conf. Systems, Man, and Cybernetics, 1998, pp. 2774-2779.
  • J. Inagaki, M. Haseyama, and H. Kitajima, "A genetic algorithm for de-termining multiple routes and its applications," in Proc. IEEE Int. Symp. Circuits and Systems, 1999, pp. 137-140.
  • Y. Leung, G. Li, and Z. B. Xu, "A genetic algorithm for the multiple destination routing problems," IEEE Trans. Evol. Comput, vol. 2, pp. 150-161, Nov. 1998.
  • G. Syswerda, "Uniform crossover in genetic algorithms," in Proc. 3rd Int. Conf. Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1989, pp. 2-9.
  • M. Parsa and Q. Zhu, "An iterative algorithm for delay-constrained minimum-cost multicasting", IEEE/ACM Transactions on Networking, vol. 6, no. 4, pp. 461 – 474, 1998.
  • Neural Networks,Fuzzy logic and Ganetic algorithm by S. Rajasekaran and G. A. Vijjylakashmi pai H. Rauch and T. Winarske, "Neural networks for routing communication traffic," IEEE Cont. Syst. Mag. , pp. 26–30, Apr. 1988.
  • P. Soueres and J. -P. Laumond, "Shortest paths synthesis for a car-like robot," IEEE Trans. Automat. Contr. , vol. 41, pp. 672–688, 1996.
  • E. L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart, and Winston, 1976, pp. 59–108.
  • J. J. Hopfield and D. W. Tank, "Neural computation of decisions in optimization problems," Biol. Cybern. , vol. 52, pp. 141–152, 1985.