Networks 3- Lecture 3 - 1

Plan
• Introduction
• Dynamic Routing
• Components of routing tables
• Classifying Routing Protocols
• RIP
• Conclusion

2 Networks 3- Lecture 2 -
 Introduction
limitations using static routing:
• Network changes require manual reconfiguration
• Does not scale well in large topologies

• Need : automate updates in routing tables when

topology changes

IP Routing – Chapter 3 - Lecture 3 - 3

 Dynamic Routing
• Dynamic routing protocols fulfill the following
functions
– Dynamically share information between routers
– Automatically update routing table when topology
changes
– Determine best path to a destination

IP Routing – Chapter 3 - Lecture 3 - 4

 Components of a routing protocol
1. Routing Table: stores the selected routes and associated
information. It is used to make decisions about how to forward
packets to their destinations.
2. Routing Algorithm: it is the core of routing process. It determines
how routers exchange information, calculate metrics, and make
decisions.
3. Metric Calculation: Metrics represent the cost associated with using
a particular route. Routing protocols calculate and compare metrics
to determine the most optimal path to a destination. Metrics can
be based on factors like bandwidth, delay, or hop count.

IP Routing – Chapter 3 - Lecture 3 - 5

Components of a routing table
1. Route source
2. Administrative distance
3. Metric

IP Routing – Chapter 3 - Lecture 3 - 6

 Components of a routing table
1. Route source

network destination and subnet remote router outgoing interface

mask
[Link]/24 [Link] Serial0/1
Route
[Link]/24 C FastEthernet 0/1

…………. …………… ………………

………….. …………… ………………

IP Routing – Chapter 3 - Lecture 3 - 7

 Components of a routing table
2. Administrative distance (AD):
• It’s a numeric value that specifies the preference
of a particular route
• AD defines the reliability of a routing protocol.

IP Routing – Chapter 3 - Lecture 3 - 8

Components of a routing table

IP Routing – Chapter 3 - Lecture 3 - 9

 Components of a routing table
[Link]: a calculated value used to determine the
best path to a destination
• Metrics used in IP routing protocols
– Bandwidth
– Cost
– Delay
– Hop count
– Load
– Reliability

IP Routing – Chapter 3 - Lecture 3 - 10

 Components of a routing table
• Hop count: The number of routers (or hops) that the packet should cross
to reach the destination.
• Path reliability: The likelihood of a link or path being operational.
• Cost: includes factors like bandwidth, delay, and reliability.
• Load : The amount of network traffic on a link
• Bandwidth: The available capacity or bandwidth of a network link
expressed in bits per second.
• Delay: The time it takes for a packet to traverse a network link.
Note: Each routing protocol has its own method for calculating metrics
based on the specific characteristics it considers. For example, protocols
like RIP may prioritize simplicity and use hop count as the primary
metric, while more sophisticated protocols like OSPF and EIGRP consider
multiple factors to make more informed routing decisions.

IP Routing – Chapter 3 - Lecture 3 - 11

 Components of a routing table
• Convergence is the state of a set of routers that
have the same topological information about the
network in which they operate.
• Convergence time is a measure of how fast a
group of routers reach the state of convergence.
• Router convergence process and time vary by
routing protocols
short convergence time  efficient routing
algorithm
Classifying Routing Protocols
IGP vs EGP

IP Routing – Chapter 3 - Lecture 3 - 13

 Classifying Routing Protocols
Autonomous System
• AS is a collection of routers that share similar routing policies and
operate under the control of a single technical administration
entity.

Telecom Algeria

DJAWAB
Google

IP Routing – Chapter 3 - Lecture 3 - 14

• It is under the administration of a single technical
entity, uses a single address architecture, a single
routed protocol, and usually one routing protocol.
• An autonomous system has the ability to connect
to other autonomous systems managed by the
same organization.
• Each autonomous system can support multiple
interior routing protocols that dynamically
exchange routing information.
 Classifying Routing Protocols
Autonomous System
• Each autonomous system can support multiple interior routing
protocols that dynamically exchange routing information.

Telecom Algeria

DJAWAB
Google

IP Routing – Chapter 3 - Lecture 3 - 16

The Regional Internet Registries (RIR) assigns a unique number
to each public autonomous system that directly connects to the
Internet. As presented in the following table, these AS
numbers are associated with three main groups (Reserved-
Public-Private) ASNs Purpose

0 Reserved

1 to 64511 Public AS

64512 to 65535 Private AS

Classifying Routing Protocols
 RIP : Routing Information Protocol
▪ RIP is distance vector protocol. It is based on Bellman-Ford
algorithm
▪It periodically broadcasts the contents of its routing table to its
immediate neighbors (directly connected routers).
▪ Each entry in the table is made up of the destination, distance, and
next-hop router.
▪RIP uses hop count as a metric.
▪ Crossing a router counts as one step (one hop).
▪ RIP assigns the value 0 for a connected network, 1 for a network
reached through a router, and so on.
 RIP principle :-Initialization -
•At startup the router detects all active interfaces, and thus creates the
routing table of direct routes.
•It sends a request to each of the interfaces in order to obtain the
complete routing tables of the other neighboring routers.
• The router receives lists of networks reachable by adjacent routers,
with a distance associated with each destination.
•When a new destination is received, the router adds it to its routing
table, indicating as the destination address, the source address at the
origin of the RIP message.
 Example
At startup : router detects two links directly connected

Destination Distance Next hop

[Link] 0 Direct
[Link] 0 Direct

After receiving the routing tables from these neighbors  it updates its own routing table

Destination Distance Next hop

[Link] 0 Direct
[Link] 0 Direct
[Link] 5 [Link]
[Link] 3 [Link]
[Link] 4 [Link]
[Link] 7 [Link]
 RIP principle:-Adding a route-
•After the initialization phase, the router will broadcast regularly on
each of its interfaces, by default every 30 seconds, its routing table.
•The router receives information from other routers.
• If an existing destination in the routing table is received by the
router then it compares the distances and keeps the entry with the
smallest distance in its routing table.
• It then broadcasts this information to the other interfaces.
 Example : Adding a route

Destination Distance Next hop Routeur [Link]

[Link] 0 Direct Destination Distance

[Link] 0 Direct [Link] 3

[Link] 4
[Link] 2
[Link] 6

Destination Distance Next hop [Link] 9

[Link] 0 Direct
[Link] 0 Direct Destination Distance Next hop
Comparaison
[Link] 7 [Link] [Link] 0 Direct
[Link] 5 [Link] [Link] 0 Direct
[Link] 4 [Link] [Link] 4+1 [Link]
[Link] 7 [Link] updates
[Link] 2+1 [Link]
[Link] 4 [Link]
[Link] 7 [Link]
Destination Distance Next hop Routeur [Link]

[Link] 0 Direct Destination Distance

[Link] 0 Direct [Link] 3

[Link] 4
[Link] 2
[Link] 6

Destination Distance Next hop [Link] 9

[Link] 0 Direct
[Link] 0 Direct Destination Distance Next hop
Comparaison
[Link] 7 [Link] [Link] 0 Direct
[Link] 5 [Link] [Link] 0 Direct
[Link] 4 [Link] [Link] 4+1 [Link]
[Link] 7 [Link] updates
[Link] 2+1 [Link]
[Link] 4 [Link]
[Link] 7 [Link]
 RIP principle:-deleting a route-
•The maximum distance (number of jumps) is 15;
•From 16 routers the packet is lost.
•Three timer instances
1- Update routing table every 30 seconds
2- Invalidation timeout = 180 seconds without news of this route,
the router marks the destination router unreachable
3- Erasure delay = 240 seconds without news of the unreachable
route, the router erases it from its routing table after 240s.
 Conclusion
RIPv1 VS RIPv2
RIPv1 vs RIPv2
• RIP v1 uses the classful routing (Classful addressing, for example,
a Class A uses a subnet mask of [Link]
• RIP v1 does not support authentication of update messages
(plain-text or MD5: Message Digest Algorithm 5 ).
• RIP v1 is an older, no longer much used routing protocol.
• RIP v2 is a classless protocol and it supports classful, variable-
length subnet masking (VLSM), CIDR, and route summarization.
• RIPv2 supports authentication of RIPv2 update messages (MD5
or plain-text).
• Authentication helps in confirming that the updates are coming
from authorized sources.
• It also supports multicast routing updates to reduce resource
consumption
 Conclusion
RIPv1 vs RIPv2
• RIPng(RIP Next Generation) extends RIPv2 to
support IPv6 routing; works very similar to RIPv2