|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
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
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.