CA - Ex - S2M04 - Distance Vector Routing Protocols - PPT (Compatibility Mode)

Chapter 4 Distance Vector Routing Protocols
CCNA Exploration version 4.0
Objectives

Identify the characteristics of distance vector routing protocols. Describe the network discovery process of distance vector routing protocols using Routing Information Protocol (RIP). Describe the processes to maintain accurate routing tables used by distance vector routing protocols. Identify the conditions leading to a routing loop and explain the implications for router performance. Recognize that distance vector routing protocols are in use today
H c vi n m ng Bch Khoa - Website: www.bkacad.com
Introduction to Distance Vector Routing Protocols
Distance Vector Routing Protocols
28 routers shown in the figure

H c vi n m ng Bch Khoa - Website: www.bkacad.com 4
Dynamic routing protocols help the

network administrator overcome the time-consuming and exacting process of configuring and maintaining static routes. What happens when a link goes down? How do you ensure that redundant paths are available?
Routing Information Protocol (RIP): RFC 1508 Hop count is used as the metric Maximum hop count is 15 Routing updates are broadcast (ver1) or multicast (ver2) every 30 seconds
Distance Vector Routing Protocols Interior Gateway Routing Protocol (IGRP) Proprietary protocol developed by Cisco. Bandwidth, delay, load and reliability are used to create a composite metric. Routing updates are broadcast every 90 seconds, IGRP is the predecessor of EIGRP and is now obsolete
Enhanced Interior Gateway Routing Protocol (EIGRP) It can perform unequal cost load balancing. It uses Diffusing Update Algorithm (DUAL) to calculate the shortest path. Routing updates are sent only when there is a change in the topology.
Distance Vector Technology
Distance Vector Technology
The Meaning of Distance Vector: a router using distance vector routing protocols knows 2 things: 1. Distance to final destination 2. Vector or direction traffic should be directed Routers using distance vector routing are not aware of the network topology. The router knows only: 1. The direction or interface in which packets should be forwarded 2. The distance or how far it is to the destination network
10
Characteristics of DV Routing Protocol
1.Periodic updates 2.Neighbors: Routing by rumor 3.Broadcast updates 255.255.255.255 4.Entire routing table is included with routing update
Characteristics of DV Routing Protocol
Animation 4.1.2.2
12
Routing Protocol Algorithms
The algorithm used for the routing

protocols defines the following processes: 1. Mechanism for sending and receiving routing information. 2. Mechanism for calculating the best paths and installing routes in the routing table. 3. Mechanism for detecting and reacting to topology changes.
Animation 4.1.3
Routing Protocol Characteristics
Criteria used to compare routing protocols

includes: 1. Time to convergence 2. Scalability 3. Classless (use of VLSM) or Classful 4. Resource usage 5. Implementation & maintenance
14
Routing Protocol Characteristics
15
Animation 4.1.4.2
Network Discovery
17
Cold Start
Router initial start up After a cold start and before the exchange of routing information, the routers initially discover their own directly connected networks and subnet masks.
Animation 4.2.1.1
18
Exchange of Routing Information

Animation 4.2.2.1 Initial Exchange: 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: 1. Metric is updated 2. New information is stored in routing table 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
Initial Exchange of Routing Information
10.1.0.0
10.2.0.0
10.3.0.0
10.4.0.0
Routing Table 10.1.0.0 10.2.0.0 10.3.0.0 0 0 1
Routing Table 10.2.0.0 10.3.0.0 10.1.0.0 10.4.0.0 0 0 1 1
Routing Table 10.3.0.0 10.4.0.0 10.2.0.0 0 0 1
10.4.0.0
2
10.1.0.0
2
20
Convergence
Convergence must be reached before a

network is considered completely operable Speed of achieving convergence consists of 2 interdependent categories 1. Speed of broadcasting routing information update 2. Speed of calculating routes
Animation 4.2.4.1
Routing Table Maintenance
22
Periodic Updates : RIPv1 & IGRP
23
Periodic updates are time intervals in

which a router sends out its entire routing table. Changes may occur for several reasons, including: 1. Failure of a link 2. Introduction of a new link 3. Failure of a router 4. Change of link parameters
24
25
RIP uses 4 timers

Update timer 30s Invalid timer 180s Holddown timer 180s Flush timer 240s
26
RIP Timers
Update Invalid
30 secs Update and Invalid timers are then reset. 180 secs - Invalid timer expires, route now
unreachable but still in routing table until flush timer expires. Holddown timer of 180 sec begins.
Holddown Flush
180 secs Holddown timer

expires, will now accept a poorer route to same network. Still in routing table
240 secs
Route will now be removed from the routing table.
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. Holddown Timer. This timer stabilizes routing information and helps prevent routing loops during periods when the topology is converging on new information. Once a route is marked as unreachable, it must stay in holddown long enough for all routers in the topology to learn about the unreachable network. By default, the holddown timer is set for 180 seconds.
Bounded Updates: EIGRP EIRPG routing updates are 1. Partial updates 2. Triggered by topology changes 3. Bounded: meaning the propagation of partial updates are automatically bounded so that only those routers that need the information are updated. 4. Non periodic
29
Triggered Updates
Conditions in which triggered updates are sent: 1. An interface changes state 2. A Route becomes unreachable 3. A Route is placed in routing table
Animation 4.3.3
30
Triggered Updates
Two problems: 1. Packets containing the update message can be dropped or corrupted by some link in the network. 2. The triggered updates do not happen instantaneously. It is possible that a router that has not yet received the triggered update will issue a regular update at just the wrong time, causing the bad route to be reinserted in a neighbor that had already received the triggered update.
Random Jitter
Synchronized updates: a condition where multiple routers on multi access LAN segments transmit routing updates at the same time. Problems: Bandwidth consumption Packet collisions Solution: used of random variable called RIP_JITTER, 0% to 15% of the specified update interval (25 to 30 seconds for the default 30-second interval)
Random Jitter
Animation 4.3.4.1
33
Routing Loop
34
Definitions & Implications
Routing loop is a condition in

which a packet is continuously transmitted within a series of routers without ever reaching its destination.
35
Routing loops may be caused by: 1. Incorrectly configured static routes 2. Incorrectly configured route redistribution 3. Slow convergence 4. Incorrectly configured discard routes
Animation 4.4.1.1
Routing loops can create the following conditions: 1. Excess use of bandwidth 2. CPU resources may be strained 3. Network convergence is degraded 4. Routing updates may be lost or not processed in a timely manner
Animation 4.4.1.1
The Solutions
1.Defining a maximum metric to

prevent count to infinity 2.Holddown timers 3.Split horizon 4.Route poisoning or poison reverse 5.Triggered updates
Lab 4.4.1.2
39
Count to Infinity
This is a routing loop whereby packets bounce infinitely around a network.
Animation 4.4.2.1
Setting a maximum
Distance Vector routing protocols set a specified metric value to indicate infinity Once a router counts to infinity it marks the route as unreachable
41
Setting a maximum
42
Preventing Routing Loops with Holddown Timers
Network is unstable: a interface resets as

up, then down, then up again in rapid succession. The route is flapping. Using triggered updates, the routers might react too quickly and unknowingly create a routing loop. A routing loop could also be created by a periodic update that is sent by the routers during the instability.
Preventing Routing Loops with Holddown Timers
Holddown timers allow a router to not accept

any changes to a route for a specified period of time Holddown timers prevent routing loops from being created by these conditions. Holddown timers also help prevent the count to infinity condition. Point of using holddown timers: Allows routing updates to propagate through network with the most current information.
Holddown timers
1. A router receives an update from a neighbor indicating that a network that previously was accessible is now no longer accessible.
45
Holddown timers
2. The router marks the network as possibly down and starts the holddown timer.
46
Holddown timers
3. If an update with a better metric for that network is received from any neighboring router during the holddown period, the network is reinstated and the holddown timer is removed.
47
Holddown timers
4. If an update from any other neighbor is received during the holddown period with the same or worse metric for that network, that update is ignored. Thus, more time is allowed for the information about the change to be propagated.
48
Holddown timers
5. Routers still forward packets to destination networks that are marked as possibly down. This allows the router to overcome any issues associated with intermittent connectivity. If the destination network truly is unavailable and the packets are forwarded, black hole routing is created and lasts until the holddown timer expires.
49
Split Horizon Rule
A router should not advertise a network through the interface from which the update came.
Animation 4.4.5.1
50
Split horizon with Poison Reverse or Route Poisoning
Route poisoning is used to mark the route as unreachable in a routing update that is sent to other routers. Split horizon with poison reverse: The rule states that once a router learns of an unreachable route through an interface, advertise it as unreachable back through the same interface Animation 4.4.6.1 Animation 4.4.6.2
IP & TTL
Purpose of the TTL field The TTL field is found in an IP header and is used to prevent packets from endlessly traveling on a network
52
IP & TTL
How the TTL field works TTL field contains a numeric value The numeric value is decreased by one by every router on the route to the destination. If numeric value reaches 0 then Packet is discarded
53
Distance Vector Routing Protocols today
54
RIP and EIGRP
Factors used to determine whether

to use RIP or EIGRP include 1. Network size 2. Compatibility between models of routers 3. Administrative knowledge
55
RIP
Supports split horizon & split horizon

with poison reverse Capable of load balancing Easy to configure Works in a multi vendor router environment
56
RIP
RIPv2 introduced the following improvements to RIPv1: 1. Includes the subnet mask in the routing updates, making it a classless routing protocol. 2. Has authentication mechanism to secure routing table updates. 3. Supports variable length subnet mask (VLSM). 4. Uses multicast addresses instead of broadcast. 5. Supports manual route summarization.
57
EIGRP
1. Triggered updates 2. EIGRP hello protocol used to establish

neighbor adjacencies 3. Supports VLSM & route summarization 4. Use of topology table to maintain all routes 5. Classless distance vector routing protocol 6. Cisco proprietary protocol
Distance Vector Routing Protocols Compared
Animation 4.5.1.1
Summary
60
Q&A
Three routers running a distance-vector

routing protocol lost all power, including the battery backups. When the routers reload, what will happen? They will send updates that include only directly connected routes to their directly connected neighbors.
61
Q&A
What does the RIP holddown timer do?

instructs routers to ignore updates, for a specified time or event, about possible inaccessible routes
62
Q&A
Which of the following methods does

split horizon use to reduce incorrect routing information? Information learned from one source is not distributed back to that source
63
Q&A
Which of the following can exist in a

distance vector network that has not converged? routing loops inconsistent traffic forwarding inconsistent routing table entries
64
Q&A
If all routers are using RIP, how many

rounds of updates will occur before all routers know all networks?
66

CA - Ex - S2M04 - Distance Vector Routing Protocols - PPT (Compatibility Mode)

Uploaded by

Copyright:

Available Formats

You might also like

CA - Ex - S2M04 - Distance Vector Routing Protocols - PPT (Compatibility Mode)

Uploaded by

Document Information

Original Description:

Original Title

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

CA - Ex - S2M04 - Distance Vector Routing Protocols - PPT (Compatibility Mode)

Uploaded by

Copyright:

Available Formats

Chapter 4 Distance Vector Routing Protocols

CCNA Exploration version 4.0

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Introduction to Distance Vector Routing Protocols

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Distance Vector Routing Protocols

28 routers shown in the figure

Distance Vector Routing Protocols

Dynamic routing protocols help the

Distance Vector Routing Protocols

H c vi n m ng Bch Khoa - Website: www.bkacad.com

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Distance Vector Routing Protocols

Distance Vector Technology

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Distance Vector Technology

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Characteristics of DV Routing Protocol

Characteristics of DV Routing Protocol

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Routing Protocol Algorithms

The algorithm used for the routing

Routing Protocol Characteristics

Criteria used to compare routing protocols

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Routing Protocol Characteristics

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Distance Vector Routing Protocols

H c vi n m ng Bch Khoa - Website: www.bkacad.com

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Exchange of Routing Information

Initial Exchange of Routing Information

Routing Table 10.1.0.0 10.2.0.0 10.3.0.0 0 0 1

Routing Table 10.2.0.0 10.3.0.0 10.1.0.0 10.4.0.0 0 0 1 1

Routing Table 10.3.0.0 10.4.0.0 10.2.0.0 0 0 1

Convergence must be reached before a

Routing Table Maintenance

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Periodic Updates : RIPv1 & IGRP

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Periodic Updates : RIPv1 & IGRP

Periodic updates are time intervals in

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Periodic Updates : RIPv1 & IGRP

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Periodic Updates : RIPv1 & IGRP

RIP uses 4 timers

H c vi n m ng Bch Khoa - Website: www.bkacad.com

180 secs Holddown timer

Periodic Updates : RIPv1 & IGRP

H c vi n m ng Bch Khoa - Website: www.bkacad.com

H c vi n m ng Bch Khoa - Website: www.bkacad.com

H c vi n m ng Bch Khoa - Website: www.bkacad.com

H c vi n m ng Bch Khoa - Website: www.bkacad.com

Definitions & Implications

Routing loop is a condition in

H c vi n m ng Bch Khoa - Website: www.bkacad.com