Professional Documents
Culture Documents
Panimalar Engineering College Study of Opnet
Panimalar Engineering College Study of Opnet
DEPARTMENT OF CSE
211416104185
STUDY OF OPNET
AIM:
The aim of this exercise is to configure and analyze the performance of
the Open Shortest Path First (OSPF) routing protocol and RIP.
OVERVIEW:
Routing algorithms are required to build the routing tables and hence
forwarding tables. The basic problem of routing is to find the lowest-cost path
between any two nodes, where the cost of a path equals the sum of the costs
of all the edges that make up the path.
Once a given node has a complete map for the topology of the network,
it is able to decide the best route to each destination. Calculating those routes
is based on a well-known algorithm from graph theory—Dijkstra’s shortest-
path algorithm.
PROCEDURE:
3. Save Project.
View Results
1. Go to the Results Play Animation will show the animation of the
algorithm progress.
2. To view Routing table of each router, go to Results Open simulation
log. It contains the routing table for all Routers. Click on Common
Route Table for Each router nodes.