Chabot College ELEC 99.08 Routing Loops.

Slides:



Advertisements
Similar presentations
Distance Vector Routing Protocols
Advertisements

Chapter 7 RIP version 2.
RIP2 CCNA Exploration Semester 2 Chapter 7
RIP V2 W.lilakiatsakun.  RFC 2453 (obsoletes –RFC 1723 /1388)  Extension of RIP v1 (Classful routing protocol)  Classless routing protocol –VLSM is.
RIP V2 CCNP S1(5), Chapter 4.
Routing Information Protocol (RIP) Routing Information Protocol (RIP) is a standards-based, distance-vector, interior gateway protocol (IGP) used by routers.
Copyright 2008 Kenneth M. Chipps Ph.D. Cisco CCNA Exploration CCNA 2 Routing Protocols and Concepts Chapter 4 Distance Vector Routing Protocols.
IP Routing.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 RIPv2 Routing Protocols and Concepts – Chapter 7.
Routing Protocols and Concepts – Chapter 7 Sandra Coleman, CCNA, CCAI
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 RIP version 1 Routing Protocols and Concepts – Chapter 5.
CCNA 2 v3.1 Module 7.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 RIP version 1&2 Revised by Chakchai So-In, Ph.D.
© 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 –
Distance Vector Routing Protocols Distance Vector Routing.
Distance Vector Protocols
CISCO NETWORKING ACADEMY Chabot College ELEC IP Routing Protocol Highlights.
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.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 7 Distance Vector Routing Protocols.
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
Routing/Routed Protocols. Remember: A Routed Protocol – defines logical addressing. Most notable example on the test – IP A Routing Protocol – fills the.
1 Routing Protocols and Configuration Instructor: Te-Lung Liu Program Associate Researcher NCHC, South Region Office.
Lecture Week 7 RIPv2 Routing Protocols and Concepts.
Sybex CCNA Chapter 6: IP Routing Instructor & Todd Lammle.
1 3-Oct-15 Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
Distance Vector Routing Protocols W.lilakiatsakun.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 RIPv2 Routing Protocols and Concepts – Chapter 7.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
RIP2 (Routing Information Protocol) Team Agile. Routing Protocols Link State – OSPF – ISIS Distance vector – RIP (version 1 and 2) – IGRP (Cisco Proprietary)
1 Version 3.1 Module 7 Distance Vector Routing Protocols.
Distance Vector Routing Protocols Routing Protocols and Concepts Lecture Week 4.
CCNA 2 Week 7 Distance Vector Routing. Copyright © 2005 University of Bolton Topics Distance Vector Protocol Issues RIP IGRP.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
1 1-Dec-15 S Ward Abingdon and Witney College Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
TCOM 515 Lecture 2. Lecture 2 Objectives Dynamic Routing Distance Vectore Routing Link State Routing Interior vs Exterior RIP - Routing Information Protocol.
Cisco Systems Networking Academy S2 C 12 Routing Protocols.
Routing Protocols and Concepts – Chapter 7
CCNA2 v3 Module 7 v3 CCNA 2 Module 7 JEOPARDY K. Martin.
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
1 16-Mar-16 S Ward Abingdon and Witney College RIP v1 Routing CCNA Exploration Semester 2 Chapter 5.
RIP v1– Routing Information Protocol RIP Versions –RIP v1 (original version, Doyle ch 5) –RIP v2 (improved version, Doyle ch 7) Simple distance-vector.
RIP.
Distance Vector Routing Protocols
Routing Loops.
Routing Protocols and Concepts
Routing Information Protocol (RIP)
Routing Information Protocol (RIP)
Distance-Vector Routing Protocols
CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols
Routing & Enabling RIP WAN Connections.
Distance Vector Routing Protocols
Routing Protocols and Concepts – Chapter 5
Distance Vector Routing Protocols
Routing Protocols and Concepts – Chapter 5
CIT 384: Network Administration
CCNA2 chap4 routing loops.ppt And other problems CCNA 2 Chapter 4
Routing Protocols and Concepts – Chapter 5
Routing Protocols and Concepts – Chapter 7
Distance Vector Routing Protocols
Routing Protocols and Concepts – Chapter 5
Routing Protocols and Concepts – Chapter 7
Distance Vector Routing Protocols
RIP1.ppt CCNA Exploration Semester 2 Chapter 5
Distance Vector Routing
Presentation transcript:

Chabot College ELEC 99.08 Routing Loops

Routing Loops Topics Convergence Distance Vector Routing Loops RIP v2 Discontiguous Networks

Convergence Convergence means that routers agree about the network’s available routes - the routing tables are consistent. Inconsistent routing tables is the main cause of routing loops.

Routing Loops - the Problem Problem: Using distance-vector routing, routers can learn “bad” routes and then propagate these to other routers. Result: inconsistent routing tables Result: looping packets - counting to infinity.

Routing Loops Example Example: 192.168.3.0 is directly connected to Oak’s E0. Oak’s routing table shows 192.168.3.0 is 0 hops away. 192.168.3.0 E0 S1 S1 fre S0 hay oak S0 E0 192.168.3.0

Routing Loops Example RIP, running on Oak, tells Hay that 192.168.3.0 is reachable through Oak with a distance of 0. Hay adds 1 hop to the distance and enters the route to 192.168.3.0 into its routing table. 192.168.3.0 1 S1 192.168.3.0 E0 S1 RIP S1 fre S0 hay oak S0 E0 192.168.3.0

Routing Loops Example RIP, running on Hay, tells Fre that 192.168.3.0 is 1 hop away. Fre adds 1 hop to the distance and enters the route to 192.168.3.0 into its routing table. 192.168.3.0 2 S1 192.168.3.0 1 S1 192.168.3.0 E0 RIP S1 S1 fre S0 hay oak S0 E0 192.168.3.0

Routing Loops Example The network is now “converged”. All routers have a consistent picture of the network. 192.168.3.0 2 S1 192.168.3.0 1 S1 192.168.3.0 E0 S1 S1 fre S0 hay oak S0 E0 192.168.3.0

Routing Loops Example Now network 192.168.3.0 fails... Oak stops routing packets to it and marks it as “unreachable" with a distance of 16 hops. 192.168.3.0 2 S1 192.168.3.0 1 S1 192.168.3.0 16 E0 S1 S1 fre S0 hay oak S0 E0 192.168.3.0

Routing Loops Example So far, Hay and Fre don’t know of the failure. Before Oak can tell Hay, Hay sends out its regular 30-second update to Fre and Oak. That update tells Oak that there is a route to 192.168.3.0 through Hay with a distance of 1. 192.168.3.0 2 S1 192.168.3.0 1 S1 192.168.3.0 16 E0 RIP S1 RIP S1 fre S0 hay oak S0 E0 192.168.3.0

Routing Loops Example Oak accepts the update, adds 1 to the distance and changes the vector (interface) to the dest. Now Oak wrongly believes that there is a route to 192.168.3.0 through Hay with a distance of 2. 192.168.3.0 2 S1 192.168.3.0 1 S1 192.168.3.0 2 S0 S1 RIP S1 fre S0 hay oak S0 E0 192.168.3.0

Routing Loops Example Next Oak sends its regular update to Hay, which adds 1 to the distance to 192.168.3.0. 192.168.3.0 2 S1 192.168.3.0 3 S1 192.168.3.0 2 S0 S1 RIP S1 fre S0 hay oak S0 E0 192.168.3.0

Routing Loops Example Hay again sends regular updates to Fre and Oak, and each router adds 1 to the distance to 192.168.3.0. See the problem? 192.168.3.0 4 S1 192.168.3.0 3 S1 192.168.3.0 4 S0 RIP S1 RIP S1 fre S0 hay oak S0 E0 192.168.3.0

Routing Loops Example The routing tables are not converged. If Hay receives a packet bound for 192.168.3.0, where will it send it? What will happen next? 192.168.3.0 4 S1 192.168.3.0 3 S1 192.168.3.0 4 S0 S1 S1 fre S0 hay oak S0 E0 192.168.3.0

Routing Loop Management Hop count limit stops looping packets after limit default is 15 hops for RIP (16 is considered “unreachable” or down) can be set: Commands default-metric NN hay(config)#router rip hay(config-router)#default-metric 10 hay(config-router)#^Z

Routing Loop Management Split horizon prevents sending information about a route back to the source from which an update originated. reduces the spread of bad routes & speeds convergence. is enabled by default on each interface

Routing Loops Management Split horizon on S0 prevents Oak from accepting incorrect update from Hay about 192.168.3.0. 192.168.3.0 1 S1 192.168.3.0 16 E0 split-horizon S1 RIP S1 fre S0 hay oak S0 E0 192.168.3.0

Routing Loop Management Holdowns when changes occur, holdowns force routers to “hold” the changes for a certain period of time. The router will not accept an updated route with a poorer metric until the holdown timer expires. this prevents regular updates from wrongly reinstating a route that has gone bad. Commands timers basic update invalid hold flush hay(config)#router rip hay(config-router)#timers basic 30 60 150 30 hay(config-router)#^Z See: http://www.cisco.com/en/US/products/sw/iosswrel/ps1831/products_command_summary_chapter09186a0080087eab.html#xtocid17

RIP Timers

Rapid Convergence - Sample Config 10 hops max oak#conf t oak(config)#router rip oak(config-router)#default-metric 10 oak(config-router)#timers basic 30 60 150 30 oak(config-router)#exit oak(config-if)#^Z Fast timers

Routing Loop Management Triggered Updates When changes occur, updates are sent immediately. Speeds convergence. Supported only by RIP version 2 Works together with holdowns. Consider how triggered updates & holdowns could prevent the example problem.

RIP Version 2 Key New Features: understands subnet masks, including Variable Length Subnet Masks performs “triggered updates” - sending new routing information to neighbor routers immediately after a change in the network provides an authentication mechanism (passwords) supports IP multicasting supports EGP route tags For our Lab, the key advantage is the support for subnet masks...

RIP Version 2 - Commands Configuring RIP version 2 - same as RIP but adds version 2 statement version should be the same for all routers Enables RIP routing Sets RIP version 2 oak(config)#router rip oak(config-router)#version 2 oak(config-router)#network 10.0.0.0 oak(config-router)#network 192.168.4.0 oak(config-router)#^Z

Discontiguous Networks - Problem RIP and IGRP do not support routing between subnets that are separated by other networks. RIP won’t tell router B how to reach the 172.16.1.0 /24 subnet: 10.1.0.0/16 net A B 172.16.1.0 / 24 Net 172.16.2.0 / 24 Net See http://www.cisco.com/warp/public/105/55.html

Discontiguous Networks - Solution RIP version 2 understands subnets and can be configured not to summarize subnets will not have a problem with the discontiguous subnets shown below with this config: rtrB(config)#router rip rtrB(config-router)#version 2 rtrB(config-router)#no auto-summary rtrB(config-router)#network 10.1.0.0 rtrB(config-router)#network 172.16.2.0 10.1.0.0/16 net A B 172.16.1.0 / 24 subnet 172.16.2.0 / 24 subnet

Command Summary default-metric 10 timers basic 30 180 180 240 version 2 no auto-summary