0% found this document useful (0 votes)
8 views

CN Lab Lecture 5 RIP_Fall_23_24

The document outlines the course CSC 3116 on Computer Networks, focusing on routing concepts, specifically the Routing Information Protocol (RIP). It compares static and dynamic routing, detailing the features and classifications of dynamic routing protocols, including RIP's characteristics and differences between its versions. Additionally, it provides configuration and troubleshooting commands for RIP v2, along with references and recommended books for further reading.

Uploaded by

Jamilur Reza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views

CN Lab Lecture 5 RIP_Fall_23_24

The document outlines the course CSC 3116 on Computer Networks, focusing on routing concepts, specifically the Routing Information Protocol (RIP). It compares static and dynamic routing, detailing the features and classifications of dynamic routing protocols, including RIP's characteristics and differences between its versions. Additionally, it provides configuration and troubleshooting commands for RIP v2, along with references and recommended books for further reading.

Uploaded by

Jamilur Reza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 26

RIP

Course Code: CSC 3116 Course Title: Computer Networks

Dept. of Computer Science


Faculty of Science and Technology

Lecturer No: Week No: Semester: Fall 23-24


Lecturer: Sharifa Rania Mahmud; [email protected]
Lecture Outline

1. Introduction
2. Static routing vs dynamic routing
3. Dynamic routing
4. Routing information protocol (RIP)
Introduction

❖ Routing
➢ routing is the act of forwarding network packets from a source
network to a destination networks by a router based on its routing table [2].

Fig. A simplified routing table [2]


Introduction

❖ How is the routing table created?


▪ Static routing
➢ If it is done manually by inputting information for each destination
network by a network engineer,
➢ Suitable for very small network
▪ Dynamic routing
➢ If the table is created and modified automatically depending on the
network condition by a routing protocol
➢ Dynamic routing can be deployed on small to large size network.
Dynamic Routing
Features

• Facilitates the exchange of routing information between routers


• Allow routers to dynamically learn information about remote
networks and automatically add this information to their own routing
tables
• Determines the best path to each network
Dynamic Routing….
Ways to classify routing protocols

• Interior Gateway Protocols or Exterior Gateway protocols


• Distance vector or Link state
Dynamic Routing….
IGP

❑IGP
➢ Routing inside an autonomous system (AS), where, AS is a
collection of network under a common administrator
➢ Example
o Routing Information Protocol (RIP) version 1
o Interior Gateway Routing Protocol (IGRP)
o Enhanced IGRP (EIGRP)
o Open Shortest Path First (OSPF)
o Intermediate System (IS)-IS
Dynamic Routing….
EGP

❑EGP
➢Routing between autonomous systems(AS)
➢Example
o Border Gateway Protocol (BGP)
Dynamic Routing….
Classification

Autonomous systems

An autonomous system (AS) is a very large


network or group of networks with a single
routing policy.
Dynamic Routing….
Distance vector routing

• A router communicates with its neighbors only for populating its routing table
• Distance vector means that routes are advertised as vectors of distance and
direction
• Distance is defined in terms of a metric such as hop count, and direction is
simply the next hop router or exit interface.
• Bellman-Ford algorithm is used for the best-path route determination.
• Some distance vector protocols periodically send complete routing tables to all
connected neighbors.
• In large networks, these routing updates can become enormous, causing
significant traffic on the links.
• Example
RIP, EIGRP
Dynamic Routing….
Link state routing

• A router configured with a linkstate routing protocol can create a “complete


view,” or topology, of the network by gathering information from all the
other routers.
• A router communicates with all other routers of the network
• Only send update (partial) when there is any change in the network topology
• Example
OSPF
Dynamic Routing….
Administrative Distance

• The term trustworthiness is commonly used when defining administrative


distance.
• Administrative distance (AD) defines the preference of a routing source.
• Administrative distance is an integer value from 0 to 255.
• The lower the value, the more preferred the route source.
• An administrative distance of 0 is the most preferred.
• Only a directly connected network has an administrative distance of 0,
which cannot be changed.
Dynamic Routing….
Administrative distance
RIP
Features

• Distance vector routing protocol


• Hop count is used as the metric for path selection.
• If the hop count for a network is greater than 15, RIP cannot supply a
route to that network.
• Routing updates are broadcast or multicast every 30 seconds, by
default.
• If for some reason, an update for a particular route is not received
within a period of 180 seconds then that specific route is declared as
invalid and the router which identified that, informs all its neighbors
about this invalid route.
• Has two versions: RIPv1 & RIPv2
RIP
RIP v1-vs-RIPv2
• Uses Classless addressing
RIPv1 uses classful addressing, RIPv2 uses VLSM
• Multicasting vs Broadcasting
Version 1 of RIP uses broadcasting (to 255.255.255.255) to send RIP
messages to every neighbor. In this way, all the routers on the network
receive the packets, as well as the hosts. RIP version 2, on the other hand,
uses the all-router multicast address (224.0.0.9) to send the RIP messages
only to RIP routers in the network.
• Updates
RIPv2 sends and receives version 2 updates only. RIPv1 sends version 1
updates and receives both 1 and 2, however version 2 information is
ignored.
• Authentication
RIPv2 ensure authentication, while RIPv1 does not
RIP
Routing table update

❖Cold Start
Topic Heading..
Routing table update

❖Initial Exchange of Information


Topic Heading..
Routing table update

❖Table Updating
Topic Heading..
Routing table update

❖Next Update
Topic Heading..
Another Example
Topic Heading..
New route
Topic Heading..
Removing a route
RIPv2 Configuration
172.16.1.0/30
192.168.2.0/24

172.16.1.4/30

IOS Commands
R1(config)# router rip
R1(config-router)# version 2
R1(config-router)#network 172.16.1.0
R1(config-router)#network 172.16.1.4
R1(config-router)#network 192.168.2.0
R1(config-router)#no auto-summary
RIPv2 Configuration
Trableshooting

172.16.1.0/30
192.168.2.0/24

172.16.1.4/30

▪ To show protocol properties ▪ To stop debugging


show ip protocols no debug all
▪ To show all routes ▪ To show RIP database
show ip route show ip rip database
▪ To show all RIP activities in real-time
debug ip rip
References

[1] R. Graziani and A. Johnson, Routing Protocols and Concepts, 2nd ed.,
Cisco Systems, Inc., USA, 2008, pp. 148-173.
[2] J. Macfarlane, Network Routing Basics, Wiley Publications. Inc.,
2006, USA, pp. 70-104.
Books

1. Official Cert Guide CCNA 200-301 , vol. 1, W. Odom, Cisco Press,


First Edition, 2019, USA.

2. CCNA Routing and Switching, T. Lammle, John Wily & Sons, Second
Edition, 2016, USA.

You might also like