Professional Documents
Culture Documents
TECHNOLOGY, RASAYANI
PROJECT REPORT
ON
“PROJECT TITLE”
OPEN SHORTEST PATH FIRST
Group Members:
1. Soumiya Mudaliar
2. Sayali Bhagat
3. Samita Bhusare
4.Vasanti Awsare
I take this opportunity to express my profound gratitude and deep regards to my guide
Prof. Pooja Pemare and Head of Department Dr. Ashok Kanthe for his exemplary
guidance, monitoring and cordial support throughout the process. She always
encouraged me to enhance my knowledge by providing me the guidance about the
selective material which I should read.
I thank our Principal Dr. Chelpa Lingam for his continuous encouragement throughout
the process. I extend my thanks to them to give me suggestions and guidance whenever
required.
I also thank my seniors and colleagues for their helping behavior without whom it
would be difficult to complete this work successfully. I would give special thanks to
my parents and friends for their proper guidance and moral support. Above all I thank
the Almighty God who is being with me and showers his blessings and grace towards
me in all walks of my life.
Abstract
In a computer network, the transmission of data is based on the routing protocol which
selects the best routes between any two nodes. Different types of routing protocols are
applied to specific network environment. Three typical types of routing protocol are
chosen as the simulation samples: RIP, OSPF and EIGRP. RIP (Routing Information
Protocol) is one of the oldest routing protocols still in service. Hop count is the metric
that RIP uses and the hop limit limits the network size that RIP can support.
OSPF (Open Shortest Path First) is the most widely used IGP (Interior Gateway
Protocol) large enterprise networks. OSPF is based on the Shortest Path First (SPF)
algorithm which is used to calculate the shortest path to each node. EIGRP Enhanced
Interior Gateway Routing Protocol) is Cisco's proprietary routing protocol based on
Diffusing Update Algorithm. EIGRP has the fastest router convergence among the
three protocols we are testing.
More detailed description of these three routing protocols will be included later. We
aim to analyze the performance of the three protocols such as their router convergence,
convergence duration and end-to-end delay. In our project, we are going to use OPNET
to simulate RIP, OSPF and EIGRP in order to compare their attributes and
performance. According to the convergence we can find out which protocols are
suitable for different sizes of network.
To implement the Extended Internet Gateway Routing Protocol in Cisco Packet Tracer
to establish a connection between n numbers of routers when they have to send a packet
throughout the network.
Introduction
The Open Shortest Path First (OSPF) protocol is a link state protocol that handles
routing for IP traffic. Its newest implementation, version 2, which is explained in RFC
2328, is an open standard. Open Shortest Path First (OSPF) is an open standard (not
proprietary) and it will run on most routers independent of make. Open Shortest Path
First (OSPF) uses the Shortest Path First (SPF) algorithm, developed by Dijikstra, to
provide a loop-free topology. Open Shortest Path First (OSPF) provides
fast convergence with triggered, incremental updates via Link State Advertisements
(LSAs). Open Shortest Path First (OSPF) is a classless protocol and allows for a
hierarchical design with VLSM and route summarization.
The main disadvantages of Open Shortest Path First (OSPF) are Open Shortest Path
First (OSPF) requires more memory to hold the adjacency (list of OSPF neighbours),
topology (a link state database containing all of the routers and their routes), and
routing tables, Open Shortest Path First (OSPF) requires extra CPU processing to run
the SPF algorithm and Open Shortest Path First (OSPF) is a complex routing protocol.
The two important concepts in case of OSPF are Autonomous Systems and Areas.
Areas are used to provide hierarchical routing, within an Autonomous System. Areas
are used to control when and how much routing information is shared across your
network.
OSPF implements a two-layer hierarchy: the backbone (Area 0) and areas off of the
backbone (Areas 1–65,535). Here the two different areas can summarize routing
information between them. Route summarization helps to compact the routing tables.
All areas should connect to Area 0 and all routers in an Area will have the same
topology table.
.
Literature Survey
The following are prerequisites for implementing OSPF on Cisco Packet Tracer
software:
• You must be in a user group associated with a task group that includes the proper task
IDs. The command reference guides include the task IDs required for each command. If
you suspect user group assignment is preventing you from using a command, contact
your AAA administrator for assistance.
• Configuration tasks for OSPFv3 assume that you are familiar with IPv6 addressing
and basic configuration. See the Implementing Network Stack IPv4 and IPv6 on Cisco
IOS XR Software module of the Cisco IOS XR IP Addresses and Services
Configuration Guide for the Cisco CRS Router for information on IPv6 routing and
addressing.
• Before you enable OSPFv3 on an interface, you must perform the following tasks:
◦Complete the OSPF network strategy and planning for your IPv6 network. For
example, you must decide whether multiple areas are required. ◦Enable IPv6 on the
interface.
This Research mainly focused on the performance analysis of Open shortest path first
protocol. Future research may include the schemes and techniques to:
Advantages
ii. (ii) Transfers packet through the network to the destinated router
v. (vi) Shares the router information and collects the IP of other router in the network
frequently.
Coding & Screenshots
The network data is transferred between the dependent nodes with fewer
distortions.
The increase in the data rate can help increase the throughput by decreasing
the end-to-end delay in OSPF.
The increase in Buffer size can help increase the throughput marginally as it
reduces the queuing delays.
Bit Error rate and Bit error rate in Packet/seconds is also analyzed for
different independent and dependent nodes.