Network Protocols

CN 321
Lecturer : Hatem Alsheibani

Chapter 3
(Introduction to Distance Vector Routing Protocols)

1-1
Why dynamic routing protocol ?

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 2
1.Distance Vector Routing Protocols
▪ Examples of Distance Vector routing protocols:
▪ Routing Information Protocol (RIP) v1,2
▪ Interior Gateway Routing Protocol (IGRP)
▪ Enhanced Interior Gateway Routing Protocol
(EIGRP)

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 3
Distance Vector Routing Protocols

▪ Distance Vector Technology

–The Meaning of Distance Vector:
• A router using distance vector routing protocols knows 2
things:
▪ Distance to final destination
▪ Vector, or direction, traffic should be directed

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 4
Distance Vector Routing Protocols

Characteristics of Distance Vector routing protocols:

▪ Periodic updates
▪ Broadcast updates
▪ Entire routing table is included into routing update

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 5
Distance Vector Routing Protocols

▪ Routing Protocol Algorithm:

-Defined as a procedure for accomplishing a certain task

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 6
Distance Vector Routing Protocols

Routing Protocol Characteristics

–Criteria used to compare routing protocols includes
▪ Time to convergence
▪ Scalability
▪ Resource usage
▪ Implementation & maintenance

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 7
Distance Vector Routing Protocols

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 8
Network Discovery

▪ Router initial start up

-Initial network discovery
▪ Directly connected networks are initially placed in
routing table

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 9
Network Discovery

▪ Initial Exchange of Routing Information

–If a routing protocol is configured then
-Routers will exchange routing information
▪ Routing updates received from other routers
-Router checks update for new information
▪ If there is new information:
-Metric is updated
-New information is
stored in routing table

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 10
Network Discovery
▪ Exchange of Routing Information
–Router convergence is reached when
-All routing tables in the network contain the same
network information
–Routers continue to exchange routing information
-If no new information is found then Convergence is
reached

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 11
Network Discovery

▪ Convergence must be reached before a network is

considered completely operable
▪ Speed of achieving convergence consists of 2 interdependent
categories
-Speed of broadcasting routing information
-Speed of calculating routes

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 12
Routing Table Maintenance

▪ Periodic Updates: RIPv1 & RIPv2

These are time intervals in which a router sends
out its entire routing table.

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 13
Routing Table Maintenance

▪ RIP uses 4 timers

-Update timer
-Invalid timer
-Hold-down timer
-Flush timer

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 14
Routing Table Maintenance

▪ Invalid Timer:- If an update has not been received to refresh

an existing route after 180 seconds (the default), the route is
marked as invalid by setting the metric to 16. The route is
retained in the routing table until the flush timer expires.
▪ Flush Timer:- By default, the flush timer is set for 240 seconds,
which is 60 seconds longer than the invalid timer. When the
flush timer expires, the route is removed from the routing table.

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 15
Update, holddown & flush timers

update update update

about certain about certain about certain
network network network

180 sec 180 sec 180 sec

Invalid timer Holddown timer Flush timer
ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 16
Routing Table Maintenance

▪ EIRPG routing updates are

-Partial updates (The Update Contain only the changed
Routes)
-Triggered by topology changes (Once a change happen,
Update is sent)
-Bounded (Update sent only to Routers who need it )
-Non periodic

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 17
Routing Table Maintenance
▪ Triggered Updates
–Conditions in which triggered updates are sent
-Interface changes state
-Route becomes unreachable
-Route is placed in routing table

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 18
Routing Protocols Today
▪ Factors used to determine whether to use RIP or EIGRP
include
-Network size
-Compatibility between models of routers
-Administrative knowledge

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 19
Routing Protocols Today

▪ RIP
▪ Features of RIP:
-Supports split horizon & split horizon with
poison reverse
-Capable of load balancing
-Easy to configure
-Works in a multi vendor router environment

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 20
Routing Protocols Today

▪ EIGRP
▪ Features of EIGRP:
-Triggered updates
-EIGRP hello protocol used to establish
neighbor adjacencies
-Supports VLSM & route summarization
-Use of topology table to maintain all routes
-Classless distance vector routing protocol
-Cisco proprietary protocol (before)

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 21
EIGRP
Enhanced Interior Gateway Routing Protocol

▪ Intro
▪ EIGRP Messages

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 22
Introduction

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 23
IGRP to EIGRP

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 24
EIGRP

▪ Roots of EIGRP: IGRP

-Developed in 1985 to overcome RIPv1’s
limited hop count
-Distance vector routing protocol
-Metrics used by IGRP
▪ bandwidth (used by default)
▪ Delay (used by default)
▪ reliability
▪ load
-Discontinued support starting with IOS
12.2(13)T & 12.2(R1s4)S

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 25
Encapsulated EIGRP message

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 26
▪ EIGRP packet header
contains
–Opcode field
–Autonomous System number

▪ EIGRP Parameters contains

–Weights
–Hold time

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 27
Protocol Dependent
Modules (PDM)
▪ EIGRP uses PDM to route
several different protocols
i.e. IP, IPX & AppleTalk
▪ PDMs are responsible for
the specific routing task
for each network layer
protocol

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 28
Reliable Transport Protocol (RTP)
▪ Purpose of RTP
–Used by EIGRP to transmit and receive
EIGRP packets
▪ Characteristics of RTP
–Involves both reliable & unreliable delivery of
EIGRP packet
▪ Reliable delivery requires
acknowledgment from destination
▪ Unreliable delivery does not require an
acknowledgement from destination
–Packets can be sent
▪ Unicast
▪ Multicast
–Using address 224.0.0.10
ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 29
EIGRP Packet types

EIGRP’s 5 Packet Types

❑ Hello packets
–Used to discover & form adjacencies with neighbors

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 30
❑ Update packets
–Used to propagate routing information

❑ Acknowledgement packets
–Used to acknowledge receipt of update, query & reply packets

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 31
❑ Query & Reply packets
▪ Used by DUAL for searching for networks
▪ Query packets
-Can use
▪ Unicast
▪ Multicast
▪ Reply packet
-Use only
▪ unicast

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 32
Hello packets:
▪ Purpose of Hello Protocol
–To discover & establish adjacencies with neighbor routers

▪ Characteristics of hello protocol

–Time interval for sending hello packet
▪ Most networks it is every 5 seconds
▪ Multipoint non broadcast multi-access networks
–Unicast every 60 seconds
-Holdtime
▪ This is the maximum time
router should wait before
declaring a neighbor down
▪ Default holdtime
–3 times hello interval

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 33
Update packet:
EIGRP Bounded Updates
▪ EIGRP only sends update when there is a change in route
status
▪ Partial update
–A partial update includes only the route information that has changed
– the whole routing table is NOT sent
▪ Bounded update
–When a route changes, only those devices that are impacted will be
notified of the change
▪ EIGRP’s use of partial bounded updates minimizes use of
bandwidth

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 34
EIGRP

Diffusing Update Algorithm (DUAL)

–Purpose
• EIGRP’s primary method for preventing routing loops
–Advantage of using DUAL
• Provides for fast convergence time by keeping a list of loop-free
backup routes

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 35
DUAL Concepts

▪ The Diffusing Update Algorithm (DUAL) is used to

prevent looping

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 36
DUAL Parameters

▪ DUAL has many parameters used to do its operation

• Successor
• Feasible Distance (FD)
• Feasible Successor (FS)
• Reported Distance (RD) or Advertised Distance (AD)
• Feasible Condition or Feasibility Condition (FC)

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 37
DUAL Concepts
▪ Successor
The best least cost route
to a destination found in
the routing table.
▪ Feasible distance (FD)
The lowest calculated
metric along a path to a
destination network
Or the metric of
Successor route.

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 38
DUAL Concepts
Feasible Successors, Feasibility Condition & Reported
Distance
▪ Feasible Successor (FS)
-This is a loop free backup
route to same
destination as successor
route. So, the router have
a Successor and Feasible
Successor or more (if
available) for each
network.

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 39
DUAL Concepts
Feasible Successors, Feasibility Condition & Reported
Distance

▪ Reported distance (RD)

-The metric that a router
reports to a neighbor
about its own cost to
that network or the
distance (metric) from
the next hop to the
destination network.

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 40
DUAL Concepts

▪ Feasibility Condition
(FC)
-Met when a neighbor’s
RD is less than the local
router’s FD to the same
destination network

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 41
DUAL Concepts
Next Hop
Distance Reported Distance
(RD) or (AD)

Feasible Distance
(FD)
▪ FD= RD + Next Hop Distance
So, Feasibility Condition is if RD<FD → loop free path

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public
if RD>= FD → loop may exist
42
DUAL Concepts
▪ Topology Table:
Successor & Feasible
Successor
▪ EIGRP Topology table
–Viewed using the show ip
eigrp topology command
▪ Contents of table include:
–all successor routes
–all feasible successor
routes

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 43
DUAL Concepts
▪ EIGRP
Topology
Table
dissected

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 44
DUAL Concepts
Topology Table: No
Feasible Successor
▪ A feasible successor may
not be present because
the feasibility condition
may not be met
-In other words, the
reported distance of
the neighbor is greater
than or equal to the
current feasible
distance

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 45
DUAL Concepts

▪ DUAL FSM
–Selects a best loop-
free path to a
destination
–Selects alternate
routes by using
information in EIGRP
tables

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 46
DUAL Concepts
Finite State Machines (FSM)
▪ To examine output from EIGRP’s finite state machine
us the debug eigrp fsm command

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 47
Basic EIGRP Configuration
▪ Autonomous System (AS) & Process IDs
–This is a collection of networks under the control of a single
authority (reference RFC 1930)
–AS Numbers are assigned by IANA
–Entities needing AS numbers
▪ ISP

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 48
▪ EIGRP autonomous system
number actually functions as a
Global process ID
▪ Process ID represents an instance
of the routing protocol running on a
router
▪ Example
Router(config)#router eigrp autonomous-
system

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 49
Basic EIGRP Configuration
The router eigrp command
▪ The global command that enables eigrp is
router eigrp autonomous-system
-All routers in the EIGRP routing domain must use
the same process ID number (autonomous-system
number)

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 50
Basic EIGRP Configuration

The Network Command

▪ Functions of the network
command
–Enables interfaces to transmit &
receive EIGRP updates
–Includes network or subnet in
EIGRP updates

▪ Example
–Router(config-router)#network
network-address

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 51
Basic EIGRP Configuration
▪ The network Command with a Wildcard Mask
-This option is used when you want to configure EIGRP
to advertise specific subnets
-Example
Router(config-router)#network network-address [wildcard-mask]

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 52
Basic EIGRP Configuration
Verifying EIGRP
▪ EIGRP routers must establish adjacencies with their
neighbors before any updates can be sent or received
▪ Command used to view neighbor table and verify that
EIGRP has established adjacencies with neighbors is
show ip eigrp neighbors

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 53
Examining the Routing
Table
▪ The show ip route
command is also used to
verify EIGRP
▪ EIGRP routes are denoted
in a routing table by the
letter “D”
▪ By default , EIGRP
automatically summarizes
routes at major network
boundary

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 54
EIGRP Metric Calculation
EIGRP Composite Metric & the K Values
▪ EIGRP uses the following values in its composite
metric
-Bandwidth, delay, reliability, and load
▪ The composite metric used by EIGRP
– formula used has values K1 →K5
K1 & K3 =1
all other K values = 0

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 55
How to calculate EIGRP metric
▪ Metric = [K1 * BW + ((K2 * BW) / (256 – load)) + K3 * delay] * [K5 / (reliability + K4)]
▪ The EIGRP metric calculation can use five variables, but EIGRP uses only two by
default:
• Bandwidth— The smallest (slowest) bandwidth between the source and destination
• Delay— The cumulative interface delay along the path
• Reliability— The worst reliability between the source and destination, based on
keepalives.
• Loading— The worst load on a link between the source and destination based on the
packet rate and the interface's
• EIGRP Metric = IGRP Metric * 256 = Metric * 256

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 56
EIGRP Metric Calculation
▪ Use the sh ip protocols command to verify the K
values

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 57
EIGRP Metric Calculation
EIGRP Metrics
▪ Use the show
interfaces command to
view metrics
▪ EIGRP Metrics
Bandwidth – EIGRP
uses a static bandwidth
to calculate metric
Most serial interfaces use
a default bandwidth value
of 1.544Mbos (T1)

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 58
EIGRP Metric Calculation
EIGRP Metrics
▪ Delay is the defined as the measure of time it takes for
a packet to traverse a route
-it is a static value based on link type to which
interface is connected

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 59
EIGRP Metric Calculation

▪ Reliability (not a default EIGRP metric)

-A measure of the likelihood that a link will fail
-Measure dynamically & expressed as a fraction of 255
the higher the fraction the better the reliability
▪ Load (not a default EIGRP metric)
– A number that reflects how much traffic is using a link
– Number is determined dynamically and is expressed as a
fraction of 255
▪ The lower the fraction the less the load on the link

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 60
EIGRP Metric Calculation
Using the Bandwidth Command
▪ Modifying the interface bandwidth
-Use the bandwidth command
-Example
Router(config-if)#bandwidth kilobits

▪ Verifying bandwidth
–Use the show interface command
▪ Note – bandwidth command
does not change the
link’s physical
bandwidth

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 61
EIGRP Metric Calculation
▪ The EIGRP metric can be determined by examining the
bandwidth & delay

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 62
EIGRP Metric Calculation

▪ EIGRP uses the lowest bandwidth (BW)in its metric calculation

Calculated BW = reference BW (10^7) / lowest BW(kbps)
▪ Delay – EIGRP uses the cumulative sum of all outgoing
interfaces
Calculated Delay = the sum of outgoing interface delays
▪ EIGRP Metric = calculated BW + calculated delay

ITE 1 Chapter 6 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 63