© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –

Slides:



Advertisements
Similar presentations
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
Advertisements

Copyright 2008 Kenneth M. Chipps Ph.D. Cisco CCNA Exploration CCNA 2 Routing Protocols and Concepts Chapter 4 Distance Vector Routing Protocols.
IP Routing.
Routing Protocol.
CCNA Guide to Cisco Networking Fundamentals Fourth Edition
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
RD-CSY3021 Comparing Routing Protocols. RD-CSY3021 Criteria used to compare routing protocols includes  Time to convergence  Proprietary/open standards.
RD-CSY /09 Distance Vector Routing Protocols.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Introducing Distance Vector Routing.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
Switching and Routing Technique
Distance Vector Protocols
Chapter 7: Routing Dynamically
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 3: Routing Dynamically Routing Protocols Assist. Prof. Pongpisit.
Distance Vector Routing Protocols W.lilakiatsakun.
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
Distance Vector Routing Protocols
M. Menelaou CCNA2 DYNAMIC ROUTING. M. Menelaou DYNAMIC ROUTING Dynamic routing protocols can help simplify the life of a network administrator Routing.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 7 Distance Vector Routing Protocols.
University of the Western Cape Chapter 11: Routing Aleksandar Radovanovic.
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
Routing/Routed Protocols. Remember: A Routed Protocol – defines logical addressing. Most notable example on the test – IP A Routing Protocol – fills the.
CN2668 Routers and Switches Kemtis Kunanuraksapong MSIS with Distinction MCTS, MCDST, MCP, A+
Routing and Routing Protocols Routing Protocols Overview.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 6 Routing and Routing Protocols.
Introduction to Dynamic Routing Protocol
Routing -2 Dynamic Routing
Review Routing fundamental W.lilakiatsakun. Review Routing Fundamental VLSM VLSM Route Summarization Route Summarization Static & Dynamic Routing Static.
TCOM 515 Lecture 2. Lecture 2 Objectives Dynamic Routing Distance Vector Routing Link State Routing Interior vs Exterior RIP - Routing Information Protocol.
1 3-Oct-15 Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
IGRP ► IGRP is a distance vector routing protocol developed by Cisco. ► IGRP sends routing updates at 90 second intervals. ► These updates advertise all.
Networks and Protocols CE Week 8a. Dynamic / Distance Vector Routing.
Chapter 4 Distance Vector Routing Protocols CIS 82 Routing Protocols and Concepts Rick Graziani Cabrillo College Last Updated: 3/9/2009.
Routing Fundamental W.lilakiatsakun. Review Routing Fundamental VLSM Static & Dynamic Routing Routing algorithm concept.
Distance Vector Routing Protocols Routing Protocols and Concepts Lecture Week 4.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Routing Protocols and Concepts Introduction to Dynamic Routing Protocol.
CCNA 2 Week 7 Distance Vector Routing. Copyright © 2005 University of Bolton Topics Distance Vector Protocol Issues RIP IGRP.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Distance Vector Routing Protocols Dynamic Routing.
1 1-Dec-15 S Ward Abingdon and Witney College Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
Chapter 4 Distance Vector Routing Protocols
TCOM 515 Lecture 2. Lecture 2 Objectives Dynamic Routing Distance Vectore Routing Link State Routing Interior vs Exterior RIP - Routing Information Protocol.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Routing with a Distance Vector Protocol in an Enterprise Network Introducing.
1 7-Jan-16 S Ward Abingdon and Witney College Dynamic Routing CCNA Exploration Semester 2 Chapter 3.
© 2002, Cisco Systems, Inc. All rights reserved..
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Routing Protocols and Concepts Dr. Muazzam A. Khan.
Prof. Alfred J Bird, Ph.D., NBCT Office – McCormick 3rd floor 607 Office Hours – Monday 3:00 to 4:00 and.
+ Dynamic Routing Protocols 2 nd semester
Routing Protocols and Concepts
Instructor Materials Chapter 5: Dynamic Routing
Distance Vector Routing Protocols
Dynamic Routing Protocols part2
Routing Loops.
CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols
Chapter 5: Dynamic Routing
Chapter 5: Dynamic Routing
Dynamic Routing Protocols part2
Distance Vector Routing Protocols
Chapter 4 Distance Vector Routing Protocols
RFC 1058 & RFC 2453 Routing Information Protocol
Distance Vector Routing Protocols
Distance Vector Routing Protocols
Distance Vector Routing
Presentation transcript:

© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts – Chapter 4

ITE PC v4.0 Chapter 1 2 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 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

ITE PC v4.0 Chapter 1 3 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 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 Distance is defined in terms of a metric such as hop count  Vector, or direction, traffic should be directed Direction is simply the next-hop router or exit interface.

ITE PC v4.0 Chapter 1 4 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Distance Vector Routing Protocols Characteristics of Distance Vector routing protocols:  Periodic updates  Neighbors ( routers that share a link and are configured to use the same routing protocol. Routers using distance vector routing are not aware of the network topology.)  Broadcast updates  Entire routing table is included with routing update

ITE PC v4.0 Chapter 1 5 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Distance Vector Routing Protocols  Dynamic routing protocols help the network administrator overcome the time-consuming and exacting process of configuring and maintaining static routes.  E.g M aintaining the static routing configurations of the 28 routers  Distance vector routing protocols include RIP, IGRP, and EIGRP.

ITE PC v4.0 Chapter 1 6 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Distance Vector Routing Protocols  Examples of Distance Vector routing protocols:  Routing Information Protocol (RIP) Routing Information Protocol (RIP) was originally specified in RFC It has the following key characteristics: Hop count is used as the metric for path selection. If the hop count for a network is greater than 15, RIP cannot supply a route to that network. Routing updates are broadcast or multicast every 30 seconds, by default.

ITE PC v4.0 Chapter 1 7 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Conti…  Interior Gateway Routing Protocol (IGRP) Interior Gateway Routing Protocol (IGRP) is a proprietary protocol developed by Cisco. IGRP has the following key design characteristics: Bandwidth, delay, load and reliability are used to create a composite metric. Routing updates are broadcast every 90 seconds, by default. IGRP is the predecessor of EIGRP and is now obsolete.

ITE PC v4.0 Chapter 1 8 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Conti…  Enhanced Interior Gateway Routing Protocol (EIGRP) Enhanced IGRP (EIGRP) is a Cisco proprietary distance vector routing protocol.  EIGRP has these key characteristics: It can perform unequal cost load balancing. It uses Diffusing Update Algorithm (DUAL) to calculate the shortest path. There are no periodic updates as with RIP and IGRP. Routing updates are sent only when there is a change in the topology.

ITE PC v4.0 Chapter 1 9 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Protocol Algorithm  Purpose of the Algorithm Core of the distance vector protocol is the algorithm. The algorithm is used to calculate the best paths and then send that information to the neighbors. An algorithm is a procedure for accomplishing a certain task, starting at a given initial state and terminating in a defined end state  Mechanism for sending and receiving routing information.  Mechanism for calculating the best paths and installing routes in the routing table.  Mechanism for detecting and reacting to topology changes.

ITE PC v4.0 Chapter 1 10 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Distance Vector Routing Protocols Routing Protocol Characteristics –Criteria used to compare routing protocols includes  Time to convergence Time to convergence defines how quickly the routers in the network topology share routing information and reach a state of consistent knowledge. The faster the convergence, the more preferable the protocol  Scalability Scalability defines how large a network can become based on the routing protocol that is deployed.  Resource usage Resource usage includes the requirements of a routing protocol such as memory space, CPU utilization, and link bandwidth utilization.

ITE PC v4.0 Chapter 1 11 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Conti…  -Implementation & maintenance Implementation and maintenance describes the level of knowledge that is required for a network administrator to implement and maintain the network based on the routing protocol deployed.

ITE PC v4.0 Chapter 1 12 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Distance Vector Routing Protocols

ITE PC v4.0 Chapter 1 13 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Network Discovery  Router initial start up (Cold Starts) -Initial network discovery  Directly connected networks are initially placed in routing table

ITE PC v4.0 Chapter 1 14 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 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 (After this first round of update exchanges, each router knows about the connected networks of their directly connected neighbors. )

ITE PC v4.0 Chapter 1 15 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 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 Note: Distance vector routing protocols typically implement a technique known as split horizon. Split horizon prevents information from being sent out the same interface from which it was received.

ITE PC v4.0 Chapter 1 16 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 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(How quickly the routers propagate a change in the topology in a routing update to its neighbors) -Speed of calculating routes(The speed of calculating best path routes using the new routing information collected.)

ITE PC v4.0 Chapter 1 17 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Table Maintenance  The age of routing information in a routing table is refreshed each time an update is received. This way information in the routing table can be maintained when there is a topology change. Changes may occur for several reasons, including:  Failure of a link  Introduction of a new link  Failure of a router  Change of link parameters Note:RIP, these updates as a broadcast ( )

ITE PC v4.0 Chapter 1 18 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Table Maintenance  RIP uses 4 timers -Update timer - 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. -Holddown timer (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) -Flush timer (By default, the flush timer is set for 240 seconds)

ITE PC v4.0 Chapter 1 19 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Conti…  Click

ITE PC v4.0 Chapter 1 20 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Table Maintenance  Bounded Updates: EIGRP  EIRPG routing updates are -Partial updates or Update Triggered by topology changes -Bounded (Updates that are sent only to those routers that need the update information instead of sending updates to all routers. -Non periodic

ITE PC v4.0 Chapter 1 21 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Table Maintenance  Triggered Updates (It does not wait for update timer to expire.) –Conditions in which triggered updates are sent -Interface changes state -Route becomes unreachable -Route is placed in routing table

ITE PC v4.0 Chapter 1 22 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Table Maintenance  Random Jitter Synchronized updates A condition where multiple routers on multi access LAN segments transmit routing updates at the same time.  Problems with synchronized updates -Bandwidth consumption -Packet collisions  Solution to problems with synchronized updates - Used of random variable called RIP_JITTER ( which subtracts a variable amount of time to the update interval for each router in the network. This random jitter, or variable amount of time, ranges from 0% to 15% of the specified update interval.)

ITE PC v4.0 Chapter 1 23 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Loops  Routing loops are A condition in which a packet is continuously transmitted within a series of routers without ever reaching its destination.

ITE PC v4.0 Chapter 1 24 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Loops  Routing loops may be caused by: -Incorrectly configured static routes -Incorrectly configured route redistribution -Slow convergence -Incorrectly configured discard routes  Routing loops can create the following issues -Excess use of bandwidth -CPU resources may be strained -Network convergence is degraded -Routing updates may be lost or not processed in a timely manner

ITE PC v4.0 Chapter 1 25 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Loops  Count to Infinity This is a routing loop whereby packets bounce infinitely around a network. Count to infinity is a condition that exists when inaccurate routing updates increase the metric value to "infinity" for a network that is no longer reachable. To eventually stop the incrementing of the metric, "infinity" is defined by setting a maximum metric value. For example, RIP defines infinity as 16 hops - an "unreachable" metric.

ITE PC v4.0 Chapter 1 26 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Loops  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

ITE PC v4.0 Chapter 1 27 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Loops  Preventing loops with holddown timers -Holddown timers allow a router to not accept any changes to a route for a specified period of time. -Point of using holddown timers  Allows routing updates to propagate through network with the most current information.

ITE PC v4.0 Chapter 1 28 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Loops  The Split Horizon Rule is used to prevent routing loops  Split Horizon rule: A router should not advertise a network through the interface from which the update came.

ITE PC v4.0 Chapter 1 29 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Loops  Split horizon with poison reverse The rule states that once a router learns of an unreachable route through an interface, advertise it as unreachable.

ITE PC v4.0 Chapter 1 30 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Loops  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  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.

ITE PC v4.0 Chapter 1 31 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Routing Protocols Today  Factors used to determine whether to use RIP or EIGRP include -Network size -Compatibility between models of routers -Administrative knowledge

ITE PC v4.0 Chapter 1 32 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 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 PC v4.0 Chapter 1 33 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 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

ITE PC v4.0 Chapter 1 34 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Summary  Characteristics of Distance Vector routing protocols –Periodic updates –RIP routing updates include the entire routing table –Neighbors are defined as routers that share a link and are configured to use the same protocol  The network discovery process for D.V. routing protocol –Directly connected routes are placed in routing table 1 st –If a routing protocol is configured then Routers will exchange routing information –Convergence is reached when all network routers have the same network information

ITE PC v4.0 Chapter 1 35 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Summary  D.V. routing protocols maintains routing tables by –RIP sending out periodic updates –RIP using 4 different timers to ensure information is accurate and convergence is achieved in a timely manner –EIGRP sending out triggered updates  D.V. routing protocols may be prone to routing loops – routing loops are a condition in which packets continuously traverse a network –Mechanisms used to minimize routing loops include defining maximum hop count, holddown timers, split horizon, route poisoning and triggered updates

ITE PC v4.0 Chapter 1 36 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Summary  Conditions that can lead to routing loops include –Incorrectly configured static routes –Incorrectly configured route redistribution –Slow convergence –Incorrectly configured discard routes  How routing loops can impact network performance includes: –Excess use of bandwidth –CPU resources may be strained –Network convergence is degraded –Routing updates may be lost or not processed

ITE PC v4.0 Chapter 1 37 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Summary  Routing Information Protocol (RIP) A distance vector protocol that has 2 versions RIPv1 – a classful routing protocol RIPv2 - a classless routing protocol  Enhanced Interior Gateway Routing Protocol (EIGRP) –A distance vector routing protocols that has some features of link state routing protocols –A Cisco proprietary routing protocol

ITE PC v4.0 Chapter 1 38 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public