Modeling and Simulation of an OSPF router

Abstract

Communication Networks continues to evolve and the demand for a High-Speed Network infrastructure has been growing at an alarming rate. The routing protocol used before was the distance-vector protocol which was consuming a long time and generate a lot of control traffic which minimizing the available bandwidth for transmission. This gives rise to the need for other routing protocol. The new link state routing protocol was extensively instrumental and monitored, and it was found to meet quite stringent performance goals, consuming less than 1 percent of link bandwidth for control traffic and less than 2 percent of router CPU for routing calculations, while responding to network changes at an average of less than 100ms. The purpose of this project is to modelling and simulation of an Open Shortest Path First (OSPF) router, which is a link state protocol uses Dijkstra algorithm to find the shortest path from each router to each other routers in the same autonomous system. We have successfully write and implement a program that allow the programmer to determine the model of its network and then uses Dijkstra algorithm to calculate the shortest paths for each router and constructing the routing table for each router and also control the incoming traffic.