Routing Aug10

Routing Information Protocol
Aug 2010
© Tech Mahindra Limited 2008 Tech Mahindra Limited confidential

Agenda
Routing
Routing vs Routed
Routing Process/Steps
Distance Vector vs Link State Algorithm
Classful vs Classless
Types of Routing
Static Route
Default Route
Interior & Exterior Routing Protocol
Summary of RIP
Summary of OSPF
CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 2

Routing
The process that a router uses to forward packets toward the

destination network.
A router makes this decision based on the destination IP

address
If dynamic routing is used, routers have to learn routes from

other routers.
If static routing is used, the administrator configures this

information into the router manually

Routed VS. Routing
• Routed protocols
are protocols that
are routed over an
Internetwork (IP,
AppleTalk, IPX)
• Routing protocols
use algorithms to
route routed
protocols through
the Internetwork
(RIP, IGRP, OSPF)
•Routed protocols are used BETWEEN routers to direct traffic

•Routing protocols allow routers to share information about
known networks with other networks (their purpose)
Routing Process

The Routing Process
192.168.1.56 • The protocol

01-00-A5-C3-26-6B
address (IP) always
remains the same.
192.168.1.56
34-7E-33-12-C9-20
192.168.1.56
6A-5F-0D-09-8B-AA
The physical
192.168.1.56 address (MAC)
BC-48-03-8F-FF-AA
changes at each
hop.
IP ROUTING OVERVIEW
Host A Host B
Applications Applications
TCP/UDP IP Forwarding and Routing IP Forwarding and Routing TCP/UDP

Protocols Protocols
IP IP IP IP
Interface Interface Interface Interface Interface Interface
Network 1 Network 2 Network 3

Routing decision criteria
Routers must determine the best route to send traffic on
toward its destination.
1. Valid next-hop IP address—When updates are received, the

router first verifies that the next-hop IP address to reach the
potential destination is valid.
2. Metric—The router then examines the metrics for the various

routes that might exist from a particular protocol. For example,
if OSPF has several routes to the destination, the router tries to
install the route with the best metric (in this case, cost) into the
routing table.
3. Administrative distance—If multiple routing protocols are

running on the device, and multiple protocols are all presenting
routes to the destination with valid next hops, the router
examines administrative distance. The route sourced from the
lowest administrative distance protocol or mechanism is
installed in the routing table.

Administrative distance
If a router learns of a network from multiple sources (routing protocols
or static configurations), it uses the administrative distance value to
determine which route to install in the routing (forwarding) table.
The default administrative distance values are listed here.

Source Administrative Distance
Connected interface 0
Static route 1
EIGRP summary route 5
External BGP 20
Internal EIGRP 90
IGRP 100
OSPF 110
IS-IS 115
RIP 120
Exterior Gateway Protocol 140
On-Demand Routing 160
External EIGRP 170
Internal BGP 200
Unknown 255
Types of Routing Algorithm

Distance Vector Routing
Neighbor to
neighbor
ONLY

Distance Vector Routing

Distance Vector Algorithm
Examples: Routing Information Protocol Version 1 (RIPv1), RIPv2,

Interior Gateway Routing Protocol (IGRP)
Features periodic transmission of entire routing tables to directly

connected neighbors
Distance vector routing protocols work by passing copies of their

routing table to their neighbors (this is also known as "routing by
rumor" because neighbors talk to neighbors and not the source of the
route).
Mathematically compares routes using some measurement of

distance
Features hop-count limitation

Link State Algorithm
Forms adjacencies with neighboring routers that speak the

same protocol; sends local link information to these devices.
Sends local connection information to all nodes in the

Internetwork.
The routers then run the Shortest Path First algorithm to

analyze all paths and determine best paths.
Note that although this is flooding of information to all

nodes, the router is sending only the portion of information
that deals with the state of its own links.
(E.g) OSPF, IS-IS

Hybrid
Example: Enhanced Interior Gateway Routing Protocol

(EIGRP)
Features properties of both distance vector and link-state

routing protocols

Path vector protocol
Example: Border Gateway Protocol (BGP).
Path vector protocols are a subset of distance vector

protocols; BGP uses “path vectors” or a list of all the
autonomous systems a prefix has crossed to make metric
decisions and to ensure a loop free environment.
In addition to the autonomous system path list, an

administrator can use many other factors to affect the
forwarding or receipt of traffic using BGP.

Distance vs Link State
Distance vector routing is less processor- and memory-
intensive than link state routing, but can have loops because
decisions are made on incomplete information.
Link state routing is loop-proof because routers know all

possible routes, but link state routing requires more CPU
time and memory.
Protocol Technique
RIP Distance Vector
RIPv2 Distance Vector
EIGRP Distance Vector
OSPF Link State
IS-IS Link State
BGP Path Vector

Review – Link State & Distance Vector

Split horizon
Split horizon is a technique used by routing protocols to help

prevent routing loops.
The split-horizon rule states that an interface will not send

routing information out an interface from which the routing
information was originally received.
Don’t tell me what I told u
Don’t Send information out of the interface, in which it is

learnt.

Summarization
Summarization is the process in which the administrator
collapses many routes with a long mask to form another
route with a shorter mask.
Route summarization reduces the size of routing tables and

makes routing function more efficiently.
Route summarization also helps make networks more stable

by reducing the number of updates that are sent when
subnets change state.
Route summarization makes classless interdomain routing

(CIDR) possible.
Variable-length subnet masking (VLSM) promotes the use of

route summarization.

Classful vs Classless

Classful routing protocols
Classful routing protocols do not include subnet mask
information with routing updates.
(e.g) RIPv1 and IGRP.
The default mask for Class A networks is /8, for Class B it is

/16, and for Class C it is /24.
This behavior is called classful, because the assumption is

based on the class of the IP address.

Classful Example RIPv1 Advertisements
Notice that no subnet mask is advertised. For instance, the
first route is 10.0.0.0 with no indication of the appropriate
subnet mask.
This shows that RIP is a classful routing protocol.
Router1# debug ip rip

RIP protocol debugging is on
00:03:40: RIP: received v1 update from 172.16.2.200 on
Serial1/0
00:03:40: 10.0.0.0 in 1 hops
00:03:40: 172.16.4.0 in 1 hops
00:03:40: 172.16.6.0 in 1 hops
00:03:40: 172.16.44.0 in 2 hops
00:03:40: 172.16.66.0 in 2 hops

Classless Routing protocol
Modern routing protocols (OSPF, IS-IS, and EIGRP) explicitly

advertise the mask.
There is no assumption involved, the mask is clearly

indicated. This behavior is referred to as classless.
Mostly used Nowadays.

Classless Example of RIPv2
Notice that the subnet mask is now advertised. RIPv2 is a
classless routing protocol.
Router1(config)# router rip

Router1(config-router)# version 2
Router1(config-router)# end
Router1#debug ip rip
RIP protocol debugging is on
00:11:07: RIP: sending v2 update to 224.0.0.9 via
FastEthernet0/0 (172.16.22.1)
00:11:07: RIP: build update entries
00:11:07: 10.0.0.0/8 via 0.0.0.0, metric 2, tag 0
00:11:07: 172.16.2.0/24 via 0.0.0.0, metric 1, tag 0
00:11:07: 172.16.4.0/24 via 0.0.0.0, metric 2, tag 0
00:11:07: 172.16.6.0/24 via 0.0.0.0, metric 2, tag 0
00:11:07: 172.16.44.0/24 via 0.0.0.0, metric 3, tag 0
00:11:07: 172.16.66.0/24 via 0.0.0.0, metric 3, tag 0
Classless vs Classful
The Internet has been classless for years and the vast
majority of enterprise networks are classless.
Classless routing protocols are necessary in today's network.
Protocol Classless or Classful
RIPv1 Classful
RIPv2 Classless
EIGRP Classless
OSPF Classless
IS-IS Classless
BGP Classless

Types of Routing

Types of Routing
Default Routing
Static Routing
Dynamic Routing
y It uses routing protocols to find the networks
Static and Default routes are managed by administrator.

Static Routing with Exit Interface
Outgoing
interface
Administrative
distance of 1 -
default

Static Routing with Next hop Interface
Next hop
interface
Administrative
distance of 1 -
default

S0 192.168.2.1/24 S0 192.168.4.1/24
Router A Router B Router C
S1 192.168.2.2/24 S1 192.168.4.2/24
192.168.1.0/24 192.168.3.0/24 192.168.5.0/24
What would you enter to configure a static route from

Router C to the LAN on Router A using outgoing
interface?
The LAN on Router B from Router A using next-hop?
Default Routes
A router should be configured with a special

type of static route – a default route.
This default route routes packets with

destinations that do not match any of the
other routes in the routing table
ip route 0.0.0.0 0.0.0.0 [next-hop-address |

outgoing interface]

Default Route on non-directly
connected networks

Summary of Static & Default
Static routing has the following benefits:
y There is no overhead on the router CPU, which means you
could possibly buy a cheaper router than you would use if you
were using dynamic routing.
y There is no bandwidth usage between routers, which means
you could possibly save money on WAN links.
y It adds security because the administrator can choose to allow
routing access to certain networks only.
Static routing has the following disadvantages:
y The administrator must really understand the Internetwork
and how each router is connected in order to configure routes
correctly.
y If a network is added to the Internetwork, the administrator
has to add a route to it on all routers—by hand.
y It’s not feasible in large networks because maintaining it
would be a full-time job in itself.
You should only use default routing on stub networks—those
with only one exit path out of the network.
Dynamic Routing - IGP vs EGP

Interior Gateway and Exterior Gateway Protocol
Most protocols are interior gateway protocols, meaning that
they are designed to run inside your network.
Inside a network, routers can trust each other and—since all

links are owned by the organization—can choose paths
without regard to who owns a link.
BGP is an exterior gateway protocol (EGP), meaning that

BGP is the routing protocol used between autonomous
systems in the public Internet.
Because it is the only EGP, you will have to consider using it

if you connect your network to the Internet.

IGP vs EGP
The routing protocols and whether each is intended for
interior or exterior use.
Protocol Interior or Exterior Gateway Protocol

RIP IGP
RIPv2 IGP
EIGRP IGP
OSPF IGP
IS-IS IGP
BGP EGP

Routing Protocol and Autonomous System
An autonomous system (AS) is a collection of networks

under a common administration sharing a common
routing strategy.
The goal of a routing protocol is to build and maintain

the routing table.
A routers learns about routes to a network by:

y Gathering information from its own configuration
regarding directly connected networks.
y Other routers forward information about known networks.
y Manually entered routes by a network administrator.

IP Routing Overview
Autonomous System A Autonomous System B
R R
IGP IGP
R EGP R
R R
Single Management Entity

EGP
Autonomous System C
R
IGP
Internet
R

Convergence Time
Convergence times are generally grouped as slow or fast.
Fast convergence means that the routing protocol is able to

recognize a problem and fix it faster than a user can call to
report the problem.
Slow protocols, such as RIP and IGRP, can take minutes to

converge.
Fast protocols, such as OSPF, IS-IS, and EIGRP, generally

converge in less than ten seconds.
Protocol Convergence Speed

RIP Slow
RIPv2 Slow
EIGRP Fast
OSPF Fast
IS-IS Fast
BGP Slow
Proprietary and Open Protocols
The routing protocols and points out which are proprietary.
Protocol Proprietary
RIP No
RIPv2 No
EIGRP Yes
OSPF No
IS-IS No
BGP No
EIGRP will be easy to configure and maintain.
EIGRP, OSPF, IS-IS will be most commonly used.

Routing Information Protocol (RIP)
4
8/10/2010 2
Introduction to RIP
RIP is the distance vector IP routing protocol Based on

Bellman-Ford algorithm
RIP is a Dynamic Internetwork routing protocol and is

primarily used in Interior routing environments (IGP)
RIP Currently available in two version: RIPv1 and RIPv2
RIP uses UDP port number 520
All RIP messages are encapsulated in UDP datagram with

both source and destination port fields set to that value 520

Introduction to RIP (contd..)
The metric used by RIP is hop count, least number of hop

count is best-path to the destination.
RIP Support only 15 hop counts, 16 is unreachable.
Hop count 1 signifying a directly connected network of the

advertising router and 16 signifying an unreachable router.
If two route are available with same hop count, equal-cost

load balancing is done
RIPv1 is a Classful Routing protocol
RIPv2 is a Classless Routing protocol
RIPv2 supports Summarization, authentication

RIPv1
RIPv1 is classful routing protocol
RIPv1 doesn't support the subnet addresses in which the

subnets bits are all zeros and all ones.
RIPv1 don't have a Authentication

RIPv1 doesn't carry next hop ip address
RIPv1 broadcasts a packet carrying a request message out

each RIP enabled Interface using 255.255.255.255
By default, IOS receives RIPv1 and RIPv2 packets, but sends

only RIPv1 packets
RIPv1 doesn’t receive the multi cast RIPv2 packets. Send &
receive RIPv1 packet
RIPv2
RIPv2 is classless routing
RIPv2 supports CIDR/VLSM
RIPv2 send the update using multicasting address
(224.0.0.9)
Subnet mask carried with each route entry
Authentication of routing updates
Next-hop addresses carried with each route entry

External route tags
If authentication enabled, then it won’t receive any RIPv1

packets and it can send/receive RIPv2 packets
If authentication disabled, it will receive & process RIPv1

packets

RIP v1 – Packet Format
Number of bytes
1 Command
1 Version
2 Reserved • Command Either Request or Response
2 Address family ID • Version – Always 1 for RIP v1
2 Reserved • AFI – Address Family Identifier
4 IP Address
Identifies routing information for
which type of network
4 Reserved • IP Address – The network for which
4 Reserved this entry is sent
4 Metric • Metric – The distance to this network
from the sender

RIP v2 – Packet Format
1 Command
1 Version
2 Reserved
2 Address family ID
2 Route tag/Authentication type
4 IP Address
4 Subnet Mask
4 Next Hop
4 Metric

RIPv1 Packet Format
Command—Indicates whether the packet is a request or a response. The

request asks that a router send all or part of its routing table. The response
can be an unsolicited regular routing update or a reply to a request.
Responses contain routing table entries. Multiple RIP packets are used to
convey information from large routing tables.
Version number—Specifies the RIP version used. This field can signal
different potentially incompatible versions.
Zero—This field is not actually used by RFC 1058 RIP; it was added solely
to provide backward compatibility with prestandard varieties of RIP. Its
name comes from its defaulted value: zero.
Address-family identifier (AFI)—Specifies the address family used. RIP
is designed to carry routing information for several different protocols. Each
entry has an address-family identifier to indicate the type of address being
specified. The AFI for IP is 2.
Address—Specifies the IP address for the entry.
Metric—Indicates how many internetwork hops (routers) have been
traversed in the trip to the destination. This value is between 1 and 15 for a
valid route, or 16 for an unreachable route.

RIPv2 Packet Format
Unused—Has a value set to zero.
Address-family identifier (AFI)—

y A new AFI of 0xffff indicates authentication
y The authentication type indicates the type of authentication that is to
be used
y Currently only password based authentication is supported
y If present the rest 16 bytes are password Route tag—Provides a
method for distinguishing between internal routes (learned by RIP) and
external routes (learned from other protocols).
IP address—Specifies the IP address for the entry.
Subnet mask—Contains the subnet mask for the entry. If this

field is zero, no subnet mask has been specified for the entry.
Next hop—Indicates the IP address of the next hop to which

packets for the entry should be forwarded.
RIP Timers
Update Time:
RIP sends update periodically.
The Time between each advertisement is update time.
RIP sends response message to RIP enabled interface after

every 30 sec
Update contains full routing table with exceptions of entries

suppressed by the split horizon rule
Update timer also adds small random delay to avoid routing

table synchronization
Hence, update time varies from 25 – 35 seconds (+/- 5 sec)

Invalid Time:
Invalidation timer used to limit the amount of time a route

can stay in the routing table without being updated
RIP calls it as expiration timer or timeout Cisco IOS call it as

invalid timer
The expiration timer is initialized to 180 seconds whenever a

new route is established and reset to the initial value
whenever an update is heard for that route.
If no updates received, wait for this long after the last

successful update before making the route is invalid. Default
is 180 secs

Hold down Time
When route became invalid, don’t accept updates about this

route for this period of time, default is 180 secs
An update with a hop count higher than the metric recorded

in the routing table will cause the route to go into hold-down
for 180 seconds.

Flush Time
The garbage collection or flush timer is set to 240 seconds –

60 seconds longer than the expiration timer
If the route has been invalid for this time, flush it (remove)
from the routing table.
Default is 240 secs for cisco .
Non cisco (RFC) supports 300 secs
The route will be advertised with the unreachable metric

until the garbage collection timer expires, at which time the
route is removed from the routing table

Difference Between RIPv1 & RIPv2
RIPv1 supports only classful addressing, and RIPv2 supports

classless (CIDR / VLSM).
RIPv2 supports authentication of routing updates.
RIPv2 supports multicast (224.0.0.9, 01-00-5E-00-00-09)

route updates, and RIPv1 supports broadcast updates
(255.255.255.255) which causes “broadcast storm”.
RIPv2 carries next hop addresses and Subnet Mask with

each route entry.
RIPv2 carries Route Tag Information
RIPv2 supports Auto and Manual summarization.

Advantages of RIP
RIP was designed for smaller inter networks
RIP is easy to Implement
RIP supports Auto and Manual summarization.
RIP doesn’t consume valuable resources in the router or

computer since there are no calculations to perform
Little overheads in terms of bandwidth, memory

consumption and processor load, etc

Disadvantages & Limitations of RIP
When RIP was designed and implemented, dynamic routing

protocols are not widely used
RIP was designed for smaller inter networks
RIP Support only 15 hop counts, 16 is unreachable.
Slow convergence
Routing Loops

Routing Aug10

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Routing Aug10

Uploaded by

Copyright:

Available Formats

Routing Information Protocol

© Tech Mahindra Limited 2008 Tech Mahindra Limited confidential

 Distance Vector vs Link State Algorithm

 Interior & Exterior Routing Protocol

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 2

 The process that a router uses to forward packets toward the

 A router makes this decision based on the destination IP

 If dynamic routing is used, routers have to learn routes from

 If static routing is used, the administrator configures this

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 3

•Routed protocols are used BETWEEN routers to direct traffic

© Tech Mahindra Limited 2008 Tech Mahindra Limited confidential

192.168.1.56 • The protocol

TCP/UDP IP Forwarding and Routing IP Forwarding and Routing TCP/UDP

Interface Interface Interface Interface Interface Interface

Network 1 Network 2 Network 3

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 7

 1. Valid next-hop IP address—When updates are received, the

 2. Metric—The router then examines the metrics for the various

 3. Administrative distance—If multiple routing protocols are

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 8

 The default administrative distance values are listed here.

© Tech Mahindra Limited 2008 Tech Mahindra Limited confidential

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 11

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 12

 Examples: Routing Information Protocol Version 1 (RIPv1), RIPv2,

 Features periodic transmission of entire routing tables to directly

 Distance vector routing protocols work by passing copies of their

 Mathematically compares routes using some measurement of

 Features hop-count limitation

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 13

 Forms adjacencies with neighboring routers that speak the

 Sends local connection information to all nodes in the

 The routers then run the Shortest Path First algorithm to

 Note that although this is flooding of information to all

 (E.g) OSPF, IS-IS

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 14

 Example: Enhanced Interior Gateway Routing Protocol

 Features properties of both distance vector and link-state

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 15

 Example: Border Gateway Protocol (BGP).

 Path vector protocols are a subset of distance vector

 In addition to the autonomous system path list, an

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 16

 Link state routing is loop-proof because routers know all

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 17

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 18

 Split horizon is a technique used by routing protocols to help

 The split-horizon rule states that an interface will not send

 Don’t tell me what I told u

 Don’t Send information out of the interface, in which it is

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 19

 Route summarization reduces the size of routing tables and

 Route summarization also helps make networks more stable

 Route summarization makes classless interdomain routing

 Variable-length subnet masking (VLSM) promotes the use of

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 20

© Tech Mahindra Limited 2008 Tech Mahindra Limited confidential

 (e.g) RIPv1 and IGRP.

 The default mask for Class A networks is /8, for Class B it is

 This behavior is called classful, because the assumption is

CONFIDENTIAL© Copyright 2008 Tech Mahindra Limited 22

 This shows that RIP is a classful routing protocol.

 Router1# debug ip rip

Distance Vector vs Link State Algorithm

Interior & Exterior Routing Protocol

The process that a router uses to forward packets toward the

A router makes this decision based on the destination IP

If dynamic routing is used, routers have to learn routes from

If static routing is used, the administrator configures this

1. Valid next-hop IP address—When updates are received, the

2. Metric—The router then examines the metrics for the various

3. Administrative distance—If multiple routing protocols are

The default administrative distance values are listed here.

Examples: Routing Information Protocol Version 1 (RIPv1), RIPv2,

Features periodic transmission of entire routing tables to directly

Distance vector routing protocols work by passing copies of their

Mathematically compares routes using some measurement of

Features hop-count limitation

Forms adjacencies with neighboring routers that speak the

Sends local connection information to all nodes in the

The routers then run the Shortest Path First algorithm to

Note that although this is flooding of information to all

(E.g) OSPF, IS-IS

Example: Enhanced Interior Gateway Routing Protocol

Features properties of both distance vector and link-state

Example: Border Gateway Protocol (BGP).

Path vector protocols are a subset of distance vector

In addition to the autonomous system path list, an

Link state routing is loop-proof because routers know all

Split horizon is a technique used by routing protocols to help

The split-horizon rule states that an interface will not send

Don’t tell me what I told u

Don’t Send information out of the interface, in which it is

Route summarization reduces the size of routing tables and

Route summarization also helps make networks more stable

Route summarization makes classless interdomain routing

Variable-length subnet masking (VLSM) promotes the use of

(e.g) RIPv1 and IGRP.

The default mask for Class A networks is /8, for Class B it is

This behavior is called classful, because the assumption is

This shows that RIP is a classful routing protocol.

Router1# debug ip rip

Modern routing protocols (OSPF, IS-IS, and EIGRP) explicitly

There is no assumption involved, the mask is clearly

Mostly used Nowadays.

Router1(config)# router rip

Classless routing protocols are necessary in today's network.

Protocol Classless or Classful

Static and Default routes are managed by administrator.

A router should be configured with a special

This default route routes packets with

Inside a network, routers can trust each other and—since all

BGP is an exterior gateway protocol (EGP), meaning that

Because it is the only EGP, you will have to consider using it

Protocol Interior or Exterior Gateway Protocol

An autonomous system (AS) is a collection of networks

The goal of a routing protocol is to build and maintain

A routers learns about routes to a network by:

Fast convergence means that the routing protocol is able to

Slow protocols, such as RIP and IGRP, can take minutes to

Fast protocols, such as OSPF, IS-IS, and EIGRP, generally

Protocol Convergence Speed

RIP is the distance vector IP routing protocol Based on

RIP is a Dynamic Internetwork routing protocol and is

RIP Currently available in two version: RIPv1 and RIPv2

RIP uses UDP port number 520

All RIP messages are encapsulated in UDP datagram with

The metric used by RIP is hop count, least number of hop

RIP Support only 15 hop counts, 16 is unreachable.

Hop count 1 signifying a directly connected network of the

If two route are available with same hop count, equal-cost

RIPv1 is a Classful Routing protocol

RIPv2 is a Classless Routing protocol

RIPv2 supports Summarization, authentication

RIPv1 doesn't support the subnet addresses in which the

RIPv1 don't have a Authentication

RIPv1 broadcasts a packet carrying a request message out

By default, IOS receives RIPv1 and RIPv2 packets, but sends

Authentication of routing updates

Next-hop addresses carried with each route entry

If authentication enabled, then it won’t receive any RIPv1

If authentication disabled, it will receive & process RIPv1

Command—Indicates whether the packet is a request or a response. The