CCDTT Packet Tracer – Configuring OSPFv2 in a Single Area

Packet Tracer – Configuring OSPFv2 in a Single Area

Download the activity here

Addressing Table

Device Interface IP Address Subnet Mask Default Gateway
R1 G0/0 N/A
S0/0/0 N/A
S0/0/1 N/A
R2 G0/0 N/A
S0/0/0 N/A
S0/0/1 N/A
R3 G0/0 N/A
S0/0/0 N/A
S0/0/1 N/A


Part 1: Configure OSPFv2 Routing

Part 2: Verify the Configurations


In this activity, the IP addressing is already configured. You are responsible for configuring the three router topology with basic single area OSPFv2 and then verifying connectivity between end devices.

Part 1:     Configure OSPFv2 Routing

Step 1:     Configure OSPF on the R1, R2 and R3.

Use the following requirements to configure OSPF routing on all three routers:

–       Process ID 10

–       Router ID for each router: R1 =; R2 =; R3 =

–       Network address for each interface

–       LAN interface set to passive (do not use the default keyword)

Step 2:     Verify OSPF routing is operational.

On each router, the routing table should now have a route to every network in the topology.

Part 2:     Verify the Configurations

Each PC should be able to ping the other two PCs. If not, check your configurations.

History of OSPFv2

Open Shortest Path First (OSPF) was designed as an interior gateway protocol, for use in an autonomous system such as a local area network (LAN). It implements Dijkstra’s algorithm, also known as the shortest path first (SPF) algorithm. As a link-state routing protocol it was based on the link-state algorithm developed for the ARPANET in 1980 and the IS-IS routing protocol. OSPF was first standardised in 1989 as RFC 1131, which is now known as OSPF version 1. The development work for OSPF prior to its codification as open standard was undertaken largely by the Digital Equipment Corporation, which developed its own proprietary DECnet protocols.

Routing protocols like OSPF calculate the shortest route to a destination through the network based on an algorithm. The first routing protocol that was widely implemented, the Routing Information Protocol (RIP), calculated the shortest route based on hops, that is the number of routers that an IP packet had to traverse to reach the destination host. RIP successfully implemented dynamic routing, where routing tables change if the network topology changes. But RIP did not adapt its routing according to changing network conditions, such as data-transfer rate. Demand grew for a dynamic routing protocol that could calculate the fastest route to a destination. OSPF was developed so that the shortest path through a network was calculated based on the cost of the route, taking into account bandwidth, delay and load. Therefore OSPF undertakes route cost calculation on the basis of link-cost parameters, which can be weighted by the administrator. OSPF was quickly adopted because it became known for reliably calculating routes through large and complex local area networks.

Share the Post:

Related Posts

Help Us By Donating