networking OSPF and RIP concept explained in presentation for assignment

assignment networks

1. FCN Assignment 3
Pratima Kumari
PRN: 250850150061

2. RIP
Routing Information Protocol (RIP) is a simple distance-vector routing protocol used by routers to share routing information within a network. It
selects the best path based on hop count and is ideal for small networks, with RIP v2 supporting subnet info and authentication.

Limitations of RIP:
RIP has several limitations that restrict its use in large networks. It has a maximum hop count of 15, so any network beyond 15 hops is considered
unreachable. RIP also has slow convergence, meaning it takes time to update routing tables after a change in the network, which can lead to
temporary routing loops. It uses periodic updates every 30 seconds, consuming bandwidth unnecessarily. Additionally, RIP lacks advanced features
like traffic load balancing and route authentication in version 1, making it less suitable for modern, large-scale networks.




RIP Configuration Steps
On Router0:

enable
configure terminal
router rip
version 2
network 61.0.0.0
network 61.0.1.0


On router 11

enable
configure terminal
router rip

3. version 2
network 61.0.2.0
network 61.0.1.0
network 61.0.3.0


On router2

enable
configure terminal
router rip
version 2
network 61.0.3.0
network 61.0.4.0


Verify RIP

show ip route
ping <other PC IP>

4. Device Interface IP Address Subnet Mask
PC0 NIC 61.0.0.2 255.255.255.0
Router0 Fa0/0 (PC0) 61.0.0.1 255.255.255.0
Router0 Fa0/1 (R0-R1) 61.0.1.1 255.255.255.0
PC1 NIC 61.0.2.2 255.255.255.0
Router1 Fa0/0 (PC1) 61.0.2.1 255.255.255.0
Router1 Fa0/1 (R1-R2) 61.0.3.1 255.255.255.0
Router2 Fa0/0 (PC2) 61.0.4.1 255.255.255.0
PC2 NIC 61.0.4.2 255.255.255.0
Router2 Fa0/1 (R2-R1) 61.0.3.2 255.255.255.0

9. OSPF

Open Shortest Path First (OSPF) is a link-state routing protocol used by routers to exchange routing information and find the shortest path within an autonomous
system. Unlike RIP, OSPF uses the Dijkstra algorithm and link-state information, which allows faster convergence and more efficient routing. It supports large
and complex networks, VLSM/CIDR, authentication, and hierarchical routing through areas. OSPF uses cost based on bandwidth as its routing metric and quickly
adapts to network changes, making it ideal for medium to large enterprise networks or lab simulations.
Limitations of OSPF:
Although OSPF is efficient and scalable, it has some limitations. It is more complex to configure compared to RIP and requires more memory and CPU resources
because each router maintains a complete link-state database. OSPF is also not suitable for very small networks due to its overhead. Additionally, frequent
changes in large networks can increase processing and network traffic because of link-state updates.

10. Final IP Addressing Plan (with PRN 61)
Device Interface IP Address Subnet Mask
PC0 NIC 192.61.0.2 255.255.255.0
R0 G0/0 → PC0 192.61.0.1 255.255.255.0

G0/1 → R1 10.0.0.1 255.255.255.0

G0/2 → R2 10.0.1.1 255.255.255.0
PC1 NIC 192.61.1.2 255.255.255.0
R1 G0/0 → PC1 192.61.1.1 255.255.255.0

G0/1 → R0 10.0.0.2 255.255.255.0

G0/2 → R2 10.0.2.1 255.255.255.0
PC2 NIC 192.61.2.2 255.255.255.0

11. Device Interface IP Address Subnet Mask
R2 G0/0 → PC2 192.61.2.1 255.255.255.0

G0/1 → R0 10.0.1.2 255.255.255.0

G0/2 → R1 10.0.2.2 255.255.255.0
OSPF Configuration
Router 0
router ospf 1
network 192.61.0.0 0.0.0.255 area 0
network 10.0.0.0 0.0.0.255 area 0
network 10.0.1.0 0.0.0.255 area 0

12. router1
router ospf 1
network 192.61.1.0 0.0.0.255 area 0
network 10.0.0.0 0.0.0.255 area 0
network 10.0.2.0 0.0.0.255 area 0
router2
router ospf 1
network 192.61.2.0 0.0.0.255 area 0
network 10.0.1.0 0.0.0.255 area 0
network 10.0.2.0 0.0.0.255 area 0