We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

An Overview: An Optimization Solution for Shortest Path Routing Problem

Published on May 2012 by Kajal Naidu, Khushboo Sahare, Kapil Wankhade
National Conference on Recent Trends in Computing
Foundation of Computer Science USA
NCRTC - Number 3
May 2012
Authors: Kajal Naidu, Khushboo Sahare, Kapil Wankhade
9c451d20-e9e3-4a05-8c5d-9bb9f5397e34

Kajal Naidu, Khushboo Sahare, Kapil Wankhade . An Overview: An Optimization Solution for Shortest Path Routing Problem. National Conference on Recent Trends in Computing. NCRTC, 3 (May 2012), 4-6.

@article{
author = { Kajal Naidu, Khushboo Sahare, Kapil Wankhade },
title = { An Overview: An Optimization Solution for Shortest Path Routing Problem },
journal = { National Conference on Recent Trends in Computing },
issue_date = { May 2012 },
volume = { NCRTC },
number = { 3 },
month = { May },
year = { 2012 },
issn = 0975-8887,
pages = { 4-6 },
numpages = 3,
url = { /proceedings/ncrtc/number3/6528-1018/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 National Conference on Recent Trends in Computing
%A Kajal Naidu
%A Khushboo Sahare
%A Kapil Wankhade
%T An Overview: An Optimization Solution for Shortest Path Routing Problem
%J National Conference on Recent Trends in Computing
%@ 0975-8887
%V NCRTC
%N 3
%P 4-6
%D 2012
%I International Journal of Computer Applications
Abstract

Intelligent analysis and designing of network routing provides an edge in this increasingly fast era. Routing is on the most important issue that has a significant impact on the networks performance. An ideal routing algorithm should strive to find an optimum path for packet transmission within specified time so as to satisfy the Quality of Service (QoS). This paper gives overview of solving shortest path routing problem. It discusses various Quality of Service parameters getting optimized solution.

References
  1. 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.
  2. 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.
  3. C. W. Ahn, R. S. Ramakrishna, C. G. Kang, and I. C. Choi, "Shortest path routing algorithm using hopfield neural network," Electron. Lett. , vol. 37, no. 19, pp. 1176–1178, Sept. 2001.
  4. W. Stalling, High-Speed Networks: TCP/IP and ATM Design Principles. Englewood Cliffs, NJ: Prentice-Hall, 1998.
  5. 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.
  6. J. Inagaki, M. Haseyama, and H. Kitajima, "A genetic algorithm for determining multiple routes and its applications," in Proc. IEEE Int. Symp. Circuits and Systems, 1999, pp. 137–140.
  7. 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.
  8. D. Ghosh, V. Sarangan, R. Acharya, "Quality-of-service routing in IP networks", IEEE Transactions on Multimedia, vol. 3, issue 2, pp. 200 - 208, June 2001.
  9. Shigang Chen, K. Nahrstedt, "An overview of quality of service routing for next-generation high-speed networks: problems and solutions", IEEE Network, vol. 12, issue 6 pp. 64-79, November/December 1998
  10. Shigang Chen, K. Nahrstelt, "Distributed quality-of-service routing in high-speed networks based on selective probing", in Proc. Of the 23rd Annual Conference on Local Conputer Networks, pp. 80 - 89, October 1998.
  11. Yi Yang, J. K. Muppala, S. T. Chanson, "Quality of service routing algorithms for bandwidth-delay constrained applications", 9th International Conference on Network Protocols, pp. 62-70, 2001.
  12. S. Chen, K. Nahrstedt, "On finding multi-constrained path", IEEE International Conference on Communication, vol. 2, pp. 874 – 879, June 1998.
  13. Zheng Wang, J. Crowcroft, "Quality-of-service routing for supporting multimedia applications", IEEE Journals on Selected Areas in Communications, vol. 14, issue 7, pp. 1228 - 1234, September 1996.
  14. BWR- B. Zhang and H. T. Mouftah, Fast bandwidth-constrained shortest path routing algorithm IEE Proc. -Communications, Vol. 153, No. 5, October 2006, pp 671-674
  15. Chang Wook Ahn, R. S. Ramakrishna, "A genetic algorithm for shortest path routing problem and the sizing of populations, IEEE transactions on Evolutionary Computing, vol. 6, pp. 566 – 579, December 2002.
  16. M. Munetomo, Y. Takai, Y. Sato, "A migration scheme for the genetic adaptive routing algorithm", IEEE International Conference on Systems, Man and Cybernatics, vol. 3, pp. 2774 – 2779, October 1998.
  17. M. Munetomo, N. Yamaguchi, K. Akama, Y. Sato, "Empirical investigations on the genetic adaptive algorithm in the Internet of 2001 Congress of Evolutionary Computing, vol. 2, pp. 1236 – 1243, May 2001.
  18. M. C. Sinclair, "Minimum cost routing and wavelength allocation using genetic algorithm/ heuristic hybrid approach", 6th IEE Conference on Telecommunications, pp 62-71, March 1998.
  19. N. Shimamoto, A. Hiramatsu, K. Yamasaki, "A dynamic routing control based on a genetic algorithm", IEEE Conference in Neural Networks, pp. 1123 – 1128, March 1993.
  20. M. Hamdan, M. E. El-Hawary, "Hopfield-Genetic approach for solving the routing problem in computer networks", Canadian Conference on Electrical and Computer Engineering, vol. 2, pp. 823 – 827, May 2002.
  21. Wang Xinhong, Wang Guangxing, "An algorithm for QoS routing to optimize network resource utilization", International Conference on Infotech and Info-net, vol. 2, pp. 474 – 479, October / November 2001.
  22. A. Riedl, "A hybrid genetic algorithm for routing optimization in IP networks utilizing bandwidth and delay metrics", IEEE Workshop on Operations and Management, pp. 166 – 170, 2002.
  23. L. Barolli, A. Koyama, H. Sawada, T. Suganuma, N. Shiratori, "A new QoS routing approach for multimedia applications based on genetic algorithm", in Proc. of the First International Symposium on Cyber Worlds, pp. 289 – 295, November 2002.
  24. L. Barolli, A. Koyama, K. Matsumoto, T. Suganuma, N. Shiratori, "A genetic algorithm based routing method using two QoS parameters", In Proc. of the 13th International Workshop on Database and Expert Systems Applications, pp. 3 – 7, September 2002.
  25. A. Koyama, L. Barolli, K. Matsumoto, B. O. Apduhan, "A GA-based multi-purpose optimization algorithm for QoS routing", 18th International Conference on Advanced Information Networking and Applications, vol. 1, pp. 23 – 28, 2004.
  26. F. Xiang, L. Junzhou, W. Jieyi, G. Guanqun, "QoS routing based on genetic algorithm", Computer Communications, pp. 1392 – 1399, September 1999.
  27. C. Chitra and P. Subbaraj, "Multiobjective optimization solution for shortest path routing problem", International Journal of Computer and Information Engineering, vol. 4, issue 2, pp. 77-85, 2010.
  28. A. Chaudhary and N. Pandey, "Genetic algorithm for shortest path in packet switching networks", Journal of Theoretical and Applied Information Technology, vol. 29, issue 2, pp. 107-117, 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Shortest Path Routing Qos Parameter Nn Genetic Algorithm