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
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Emulation of Shortest Path Algorithm in Software Defined Networking Environment

by Arnav Shivendu, Dependra Dhakal, Diwas Sharma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 116 - Number 1
Year of Publication: 2015
Authors: Arnav Shivendu, Dependra Dhakal, Diwas Sharma
10.5120/20304-2344

Arnav Shivendu, Dependra Dhakal, Diwas Sharma . Emulation of Shortest Path Algorithm in Software Defined Networking Environment. International Journal of Computer Applications. 116, 1 ( April 2015), 47-49. DOI=10.5120/20304-2344

@article{ 10.5120/20304-2344,
author = { Arnav Shivendu, Dependra Dhakal, Diwas Sharma },
title = { Emulation of Shortest Path Algorithm in Software Defined Networking Environment },
journal = { International Journal of Computer Applications },
issue_date = { April 2015 },
volume = { 116 },
number = { 1 },
month = { April },
year = { 2015 },
issn = { 0975-8887 },
pages = { 47-49 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume116/number1/20304-2344/ },
doi = { 10.5120/20304-2344 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:55:56.141269+05:30
%A Arnav Shivendu
%A Dependra Dhakal
%A Diwas Sharma
%T Emulation of Shortest Path Algorithm in Software Defined Networking Environment
%J International Journal of Computer Applications
%@ 0975-8887
%V 116
%N 1
%P 47-49
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The field of Computer network has evolved a lot since the last three decades from conventional static networks to dynamically programmed architecture. The main goal of Software Defined Networking (SDN) is for the network to be open and programmable. Traditional network devices like router and switches can take routing decision and forwarding of these packets, SDN separate these component into different planes by pulling different component apart called as Data plane and Control plane. Hence the switches only have packet forwarding capability and cannot make any routing decisions, while decision making is done by the controller. OpenFlow is the interface that helps the switches and the controller to communicate. It is a communication protocol that enables the controller to determine the route of the network packet via the switches. This project implements the Bellman – Ford algorithm to find the shortest path between two nodes in a network using SDN environment. POX API's has been used to implement the Bellman – Ford Algorithm.

References
  1. Bruno Astuto A. Nunes, Marc Mendonca, Xuan-Nam Nguyen, Katia Obraczka, Thierry Turletti, "A Survey of Software-Defined Networking: Past, Present, and Future of Programmable Networks", Vous Consultez L'Archive Hal, 19 Jan, 2014.
  2. David Walden," The Bellman-Ford Algorithm and Distributed Bellman-Ford".
  3. Shivani Sanan, Leena Jain, Bharti Kappor, "Shortest Path Algorithm", International Journal of Application or Innovation in Engineering & Management (IJAIEM).
  4. S. K. Kaur, Japinder Singh, Navtej Singh Ghumman, "Network Programmability Using POX Controller" International Conmference on Communication, Computing and Systems (ICCS 2014)
  5. N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson,J. Rexford, S. Shenker, and J Turer, "OpenFlow: enabling innovation in campus networks," SIGCOMM Comput. Commun. Rev. , vol. 38, no. 2, pp. 69–74, Mar. 2008.
  6. N. Mckeown, "How SDN will Shape Networking," October 2011. [Online]. Available: http://www. youtube. com/watch?v=c9-K5O qYgA
  7. ONF, "Open networking foundation," 2014. [Online]. Available: https://www. opennetworking. org
  8. D. Drutskoy, E. Keller, and J. Rexford, "Scalable network virtualization in software-defined networks," IEEE Internet Computing, vol. 17, no. 2, 2013, pp. 20
  9. B. Nunes, M. Mendonca, X. -N. Nguyen, K. Obraczka, and T. Turletti, "A survey of software-defined networking: Past, present, and future of programmable networks," Communications Surveys Tutorials, IEEE, vol. 16, no. 3, pp. 1617–1634, Third 2014.
  10. K. Greene, "MIT Tech Review 10 Breakthrough Technologies: Software-defined Networking," http://www2. technologyreview. com/article/412194/tr10-software-defined-networking/, 2009
  11. P. Sun, R. Mahajan, J. Rexford, L. Yuan, M. Zhang, and A. Arefin, "Anetwork-state management service," in Proceedings of the 2014 ACM Conference on SIGCOMM,
  12. M. McCauley, "POX," 2012. [Online]. Available: http://www. noxrepo. org/
  13. Masayoshi Kobayashi, Srini Seetharaman, Guru Parulkar, Guido Appenzeller , Joseph Little , Johan van Reijendam , Paul Weissmann, Nick McKeown "Maturing of OpenFlow and Software-defined Networking through deployments". (2013), http://dx. doi. org/10. 1016/j. bjp. 2013. 10. 011
  14. B. Lantz, B. Heller, N. McKeown, A network in a laptop: rapid prototyping for software-defined networks, in: Proceedings of the Ninth ACM SIGCOMM Workshop on Hot Topics in Networks, 2010.
  15. Diego Kreutz, Fernando M. V. Ramos, Paulo Verissimo, Christian Esteve Rothenberg,Siamak Azodolmolky and Steve Uhlig," Software-Defined Networking: A Comprehensive Survey" Proceedings of the IEEE (Volume:103, Issue: 1) pp 14-76, Dec 2014
Index Terms

Computer Science
Information Sciences

Keywords

Bellman – Ford Software Defined Networking (SDN) POX Mininet.

Powered by PhDFocusTM