Scribd
Upload
18 views25 pages

9

Uploaded by

Zain Ul Abedin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
18 views25 pages

9

Uploaded by

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

Group PPT

Mubashar Nazir 19011556-020


Ismail Ahmad 19011556-022
Mubashar Nazir
19011556-020
Ditance Vector Routing
Intradomain Routing
What is Intra-Domain Routing?
Routing inside an autonomous system is reffered as intradomain
routing.
Distance Vector Routing:
• It is Iterative and Distributive in nature.
• It is a Dynamic Algorithm
• Each router maintans a distance table known as Vector or
Routing table.
• This routing algorithm is Asynchronous.
• In distance vector routing, each node shares its routing table
with its immediate neighbors periodically and when there is a
change.
Background:
• It is known as the old ARPNET routing algorithm or Bellman-Ford algorithm.
• Used later in internet under routing protocol standard RIP.

Features:
• The routers send the knowledge of the whole autonomous framework.

• Sharing of data takes place only with the neighbours.

• Sending of data holds place at constant, ordinary intervals, declared


every 30 seconds(interval can be changed).
Initialization of tables in distance vector routing
Updating in distance vector routing
Distance vector routing tables at the end
Ismail Ahmad Khan
19011556-022
Count to infinity problem in Routing
• The main issue with Distance Vector Routing (DVR) protocols is
Routing Loops. This routing loop in the DVR network causes the
Count to Infinity Problem.
• Routing loops usually occur when an interface goes down or two
routers send updates at the same time.
Two-node instability
Three-node instability
Solution for Count to Infinity problem:-
Route Poisoning: Split horizon:
• When a route fails, distance vector • If the link between B and X goes down,
protocols spread the bad news about a According to the Split horizon Rule, Node
route failure by poisoning the route. A does not advertise its route for X
• Route poisoning refers to the practice of (namely A to B to X) back to B.
advertising a route, but with a special cost • On the surface, this seems redundant
value called Infinity. since B will never route via node A
• Each distance vector routing protocol because the route costs more than the
uses the concept of an actual cost value direct route from B to X.
that represents infinity.
– eg. RIP defines infinity as 16.
• The main disadvantage of poison reverse
is that it can significantly increase the size
of routing announcements
Pros and Cons of DVR
Advantages of Distance Vector routing Disadvantages of Distance Vector routing

• It is simpler to configure and maintain than • It is slower to converge than link state.
link state routing. • It creates more traffic than link state since
• Distance vector routing protocol is easy to a hop count change must be propagated to
implement in small networks. all routers and processed on each router.
• Debugging is very easy in the distance • Hop count updates take place on a
vector routing protocol. periodic basis, even if there are no
• This protocol has a very limited changes in the network topology, so
redundancy in a small network. bandwidth-wasting broadcasts still occur.
• For larger networks, distance vector
routing results in larger routing tables than
link state since each router must know
about all other routers.
Routing Information Protocol:
RIP stands for “Routing Information Protocol”. Routers use it to interchange
details in a network
Its main functions are:
 To find out the most effective way to route data on a network
 To avoid routing loops

The main advantage of RIP is that its bandwidth utilization is very high and it
updates every 30 seconds.
However, a maximum of 16 routers can be composed, as it supports only 15
hop counts. 16 is considered infinity.
RIPv1 vs RIPv2
RIPv1 RIPv2
This protocol is a Distance-Vector routing protocol. This protocol is also a distance-vector routing
protocol.
It can assist with a complete class network only. It can assist complete class networks and classless
networks.
It does not keep up with documentation. It keeps up with documentation.

RIPv1 hop count limit is 15. RIPv2 hop count limit is also 15.

Not good security. Security is good.

It does not give the activate updates. It gives the activate updates.

It does not send a subnet mask to the table. It sends a subnet mask to the table.
RIPv1 message format

• Command—Type of message. 1 indicates request, which is used to request all or part of the routing information
from the neighbor; 2 indicates response, which contains all or part of the routing information. A response message
consists of up to 25 route entries.
• Version—Version of RIP, 0x01 for RIPv1.
• Must be zero—This field must be zero
• AFI—Address Family Identifier, 2 for IP.
• IP address—Destination IP address of the route that can be a natural network, subnet, or a host address.
• Metric—Cost of the route.
Messages:
• RIP defines two message types: Request messages and Response
messages.

• A Request message is used to ask neighboring routers to send an update.


• A Response message carries the update.
RIPv2 message format

• Version–Version of RIP. For RIPv2 the value is 0x02.


• Route tag-- this is an attribute assigned to a route which must be preserved and readvertised with a
route. The intended use of this tag is to provide a method of separating routes for networks within the
RIP routing domain from routes
• IP address—Destination IP address. It can be a natural network address, subnet address, or host
address.
• Subnet mask—Mask of the destination address. Unlike RIPv1, RIPv2 can carry subnet information.
• Next hop
Authentication
• Authentication Type—A
value of 2 represents simple
authentication.

• Authentication—
Authentication data,
including password
information when simple
authentication is adopted or
including key ID.
RIP timers

• Periodic: the default RIP update timer is 30 seconds. Every 30 seconds the
router blasts out its routing table to all of its directly connected neighbors.
• Expiration: The invalid timer specifies how long a routing entry can be in
the routing table without being updated.
• Garbage collection: This is a timer that counts a number of seconds before
the newly invalid route will be actually removed from the table.
Any Questions‽
THANK YOU

You might also like