Scribd
Upload
48 views10 pages

Bellman Ford Algorithm - in Routing Information Protocol (RIP) - Slides

This document discusses the Routing Information Protocol (RIP). It summarizes that RIP is an older distance vector routing protocol that uses hop count as a routing metric. It has a maximum hop count of 15 which limits the size of networks it can support. The document also explains that RIP uses the Bellman-Ford algorithm to calculate distances and determine the shortest path between nodes by traversing all paths in the network topology.

Uploaded by

NABTI AMINA
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
48 views10 pages

Bellman Ford Algorithm - in Routing Information Protocol (RIP) - Slides

This document discusses the Routing Information Protocol (RIP). It summarizes that RIP is an older distance vector routing protocol that uses hop count as a routing metric. It has a maximum hop count of 15 which limits the size of networks it can support. The document also explains that RIP uses the Bellman-Ford algorithm to calculate distances and determine the shortest path between nodes by traversing all paths in the network topology.

Uploaded by

NABTI AMINA
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/ 10

MINI METHOD PROJET

ROUTING INFORMATION
PROTOCOL

RIP

Training: Master 2 Computer Science, Networks oriented


Telecommunications and Cloud Infrastructure

Project realized
by Amina NABTI
• RIP is one of the oldest routing
protocols, it uses hop count as a
routing measure.
• It is a level 3 distance vector
protocol.
• The maximum number of hops
allowed for RIP is 15, which limits
the size of the networks that RIP
can support.
• There are two types of version in
RIP: RIPv1 and RIPv2
BELLMAN FORD
ALGORITHM ON A
TOPOLOGIE
• The BF message is a RIP message
exchanged between nodes (routers),
with the aim of calculate the
distance and save it (fill in the
routing tables), then choose the
shortest path between the
transmitter and the receiver.

• We can therefore say that the RIP


routing protocol uses the Bellman-
Ford algorithm.
• The RIP routing protocol performs the
Bellman-Ford algorithm by traversing all
the existing paths in the tree in order to
calculate complexity in time.
• The Bellman-Ford algorithm sends
messages from the root through all nodes to
the leaves of the tree.
• We deduce the time complexity which is the
diameter of the tree, hence from the root to
the last leaves: O (diameter).
• This complexity is linked to the number of
messages exchanged between the nodes, in
the purpose of calculating the metrics and
determining the shortest path from the root
to the leaves, favoring the less loaded,
more faithful links with a wider
bandwidth.
• Since all the nodes in the topology send
and receive messages from their neighbors
by neglecting the father, the complexity
therefore amounts to calculating these
massages.
• Knowing that each node sends a message
on a link, the complexity comes back
therefore to: nodes (n) * links (E).
THANK YOU FOR
YOUR ATTENTION

You might also like