M. Menelaou CCNA2 DYNAMIC ROUTING. M. Menelaou DYNAMIC ROUTING Dynamic routing protocols can help simplify the life of a network administrator Routing.

Slides:



Advertisements
Similar presentations
Distance Vector Routing Protocols
Advertisements

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.
Cisco S3 C5 Routing Protocols. Network Design Characteristics Reliable – provides mechanisms for error detection and correction Connectivity – incorporate.
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
Chapter 5 IP Routing Routing Sending packets through network from one device to another What must routers know? – Destination address – Neighboring routers.
CCNA 2 v3.1 Module 7.
Distance Vector Routing Protocols
Chapter 5 – Routing Protocols: IGRP. Building a Network To Be Reliable – provide error detection and ability to correct errors To Provide Connectivity.
© 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 –
Switching and Routing Technique
Distance Vector Routing Protocols Distance Vector Routing.
Distance Vector Protocols
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
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
© 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.
1 Semester 2 Module 7 Distance Vector Routing Protocols Yuda college of business james Chen
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.
Sybex CCNA Chapter 6: IP Routing Instructor & Todd Lammle.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 6 Routing and Routing Protocols.
Routing -2 Dynamic Routing
Review Routing fundamental W.lilakiatsakun. Review Routing Fundamental VLSM VLSM Route Summarization Route Summarization Static & Dynamic Routing Static.
1 3-Oct-15 Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
Ch.16/Mod.7 – Distance Vector Routing Protocols Part 2 of 2: Distance Vector Routing and IGRP.
IGRP ► IGRP is a distance vector routing protocol developed by Cisco. ► IGRP sends routing updates at 90 second intervals. ► These updates advertise all.
1 Network Layer Lecture 14 Imran Ahmed University of Management & Technology.
Networks and Protocols CE Week 8a. Dynamic / Distance Vector Routing.
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 Guide to Cisco Networking Fundamentals Fourth Edition
CCNA 2 Week 7 Distance Vector Routing. Copyright © 2005 University of Bolton Topics Distance Vector Protocol Issues RIP IGRP.
Institute of Technology Sligo - Dept of Computing Sem 2 Chapter 12 Routing Protocols.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
© 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.
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.
Chabot College ELEC Routing Loops.
1 7-Jan-16 S Ward Abingdon and Witney College Dynamic Routing CCNA Exploration Semester 2 Chapter 3.
Cisco Systems Networking Academy S2 C 12 Routing Protocols.
 RIP — A distance vector interior routing protocol  IGRP — The Cisco distance vector interior routing protocol (not used nowadays)  OSPF — A link-state.
CCNA2 v3 Module 7 v3 CCNA 2 Module 7 JEOPARDY K. Martin.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Routing Protocols and Concepts Dr. Muazzam A. Khan.
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
Sem 2 v2 Chapter 12: Routing. Routers can be configured to use one or more IP routing protocols. Two of these IP routing protocols are RIP and IGRP. After.
RIP.
Routing Protocols and Concepts
Distance Vector Routing Protocols
Routing Loops.
IGRP IGRP is a distance vector routing protocol developed by Cisco.
CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols
Dynamic Routing Protocols part2
Distance Vector Routing Protocols
Distance Vector Routing Protocols
Distance Vector Routing Protocols
Distance Vector Routing Protocols
Distance Vector Routing
Presentation transcript:

M. Menelaou CCNA2 DYNAMIC ROUTING

M. Menelaou DYNAMIC ROUTING Dynamic routing protocols can help simplify the life of a network administrator Routing Information Protocol (RIP) is a distance vector routing protocol that is used in thousands of networks throughout the world. The fact that RIP is based on open standards and is very simple to implement makes it attractive to some network administrators

M. Menelaou Distance Vector Routing Routing table updates occur periodically or when the topology in a distance vector protocol network changes Routing loops can occur when inconsistent routing tables are not updated due to slow convergence in a changing network

M. Menelaou Distance Vector Routing

M. Menelaou Distance Vector Routing Just before the failure of Network 1, all routers have consistent knowledge and correct routing tables. The network is said to have converged. Assume for the remainder of this example that Router C's preferred path to Network 1 is by way of Router B, and the distance from Router C to Network 1 is 3.

M. Menelaou Distance Vector Routing When Network 1 fails, Router E sends an update to Router A. Router A stops routing packets to Network 1, but Routers B, C, and D continue to do so because they have not yet been informed of the failure. When Router A sends out its update, Routers B and D stop routing to Network 1. However, Router C has not received an update. To Router C, Network 1 is still reachable via Router B.

M. Menelaou Distance Vector Routing Now Router C sends a periodic update to Router D, indicating a path to Network 1 by way of Router B. Router D changes its routing table to reflect this good, but incorrect, information, and propagates the information to Router A. Router A propagates the information to Routers B and E, and so on. Any packet destined for Network 1 will now loop from Router C to B to A to D and back to again to C.

M. Menelaou Distance Vector Routing The routing protocol permits the routing loop to continue until the metric exceeds its maximum allowed value When the metric value exceeds the maximum value, Network 1 is considered unreachable.

M. Menelaou Split horizon Another possible source for a routing loop occurs when incorrect information that has been sent back to a router contradicts the correct information that the router originally distributed.

M. Menelaou Split horizon Split-horizon attempts to avoid this situation. If a routing update about Network 1 arrives from Router A, Router B or Router D cannot send information about Network 1 back to Router A. Split-horizon thus reduces incorrect routing information and reduces routing overhead.

M. Menelaou Split horizon

M. Menelaou Split horizon

M. Menelaou Route poisoning Route poisoning is used by various distance vector protocols in order to overcome large routing loops and offer explicit information when a subnet or network is not accessible. This is usually accomplished by setting the hop count to one more than the maximum.

M. Menelaou Route poisoning

M. Menelaou Route poisoning One way to avoid inconsistent updates is route poisoning. When Network 5 goes down, Router E initiates route poisoning by making a table entry for Network 5 as 16, or unreachable. By this poisoning of the route to Network 5, Router C is not susceptible to incorrect updates about the route to Network 5

M. Menelaou Triggered updates New routing tables are sent to neighboring routers on a regular basis. For example, RIP updates occur every 30 seconds However a triggered update is sent immediately in response to some change in the routing table.

M. Menelaou Triggered updates The router that detects a topology change immediately sends an update message to adjacent routers that, in turn, generate triggered updates notifying their adjacent neighbors of the change When a route fails, an update is sent immediately rather than waiting on the update timer to expire

M. Menelaou Hold down timers A state where the router cannot advertise or accept advertisement A router is placed in holdtime when a link of the router fails

M. Menelaou Hold down timers Holddown timers help prevent counting to infinity but also increase convergence time. The default holddown for RIP is 180 seconds The holddown timer can be decreased to speed up convergence

M. Menelaou

Hold down timers When a router receives an update from a neighbor indicating that a previously accessible network is now inaccessible, the router marks the route as inaccessible and starts a hold down timer If at any time before the hold down timer expires an update is received from the same neighbor indicating that the network is again accessible, the router marks the network as accessible and removes the hold down timer.

M. Menelaou Hold down timers If an update arrives from a different neighboring router with a better metric than originally recorded for the network, the router marks the network as accessible and removes the holddown timer. If at any time before the holddown timer expires an update is received from a different neighboring router with a poorer metric, the update is ignored.

M. Menelaou RIP routing process RIP has evolved over the years from a Classful Routing Protocol, RIP Version 1 (RIP v1), to a Classless Routing Protocol, RIP Version 2 (RIP v2). RIP v2 enhancements include: Ability to carry additional packet routing information. Authentication mechanism to secure table updates. Supports variable length subnet masking (VLSM).

M. Menelaou RIP routing process RIP prevents routing loops from continuing indefinitely by implementing a limit on the number of hops allowed in a path from the source to a destination When a router receives a routing update that contains a new or changed entry, the metric value is increased by 1 RIP implements split horizon and holddown mechanisms to prevent incorrect routing information from being propagated.

M. Menelaou RIP routing process

M. Menelaou RIP routing process

M. Menelaou RIP routing process router running RIP can be configured to send a triggered update when the network topology changes using the ip rip triggered command This command is issued only on serial interfaces at the router(config-if)# These updates, called triggered updates, are sent independently of the regularly scheduled updates that RIP routers forward

M. Menelaou RIP routing process IP Classless command – If a router receives packets for a subnet not in the routing table of the router and the ip classless command is disable the packet will be discarded – classless command is enabled by default in Cisco IOS Software Release 11.3 and later. – To disable this feature, use the no form of this command. – Is a global configuration command

M. Menelaou RIP routing process Convergence is when all routers in the same internetwork have the same routing information.

M. Menelaou RIP routing process There are several commands that can be used to verify that RIP is properly configured. Two of the most common are the show ip route command and the show ip protocols command

M. Menelaou RIP routing process Most of the RIP configuration errors involve an incorrect network statement, discontiguous subnets, or split horizons. One highly effective command for finding RIP update issues is the debug ip rip command The debug ip rip command displays RIP routing updates as they are sent and received

M. Menelaou RIP routing process Using the passive interface command can prevent routers from sending routing updates through a router interface Keeping routing update messages from being sent through a router interface prevents other systems on that network from learning about routes dynamically.

M. Menelaou RIP routing process For RIP and IGRP, the passive interface command stops the router from sending updates to a particular neighbor, but the router continues to listen and use routing updates from that neighbor

M. Menelaou RIP routing process Load-balancing describes the ability of a router to transmit packets to a destination IP address over more than one path The paths are derived either statically or with dynamic protocols, such as RIP, EIGRP, OSPF, and IGRP.

M. Menelaou RIP routing process

M. Menelaou IGRP IGRP is a distance vector routing protocol developed by Cisco. IGRP sends routing updates at 90 second intervals By default, the IGRP routing protocol uses bandwidth and delay as metrics

M. Menelaou IGRP Additionally, IGRP can be configured to use a combination of variables to determine a composite metric. Those variables include: – Bandwidth – Delay – Load – Reliability

M. Menelaou IGRP The composite metric of IGRP is more accurate than the hop count metric that RIP uses when choosing a path to a destination. The path that has the smallest metric value is the best route.

M. Menelaou IGRP The metrics that IGRP uses are : Bandwidth – The lowest bandwidth value in the path Delay – The cumulative interface delay along the path Reliability – The reliability on the link towards the destination as determined by the exchange of keepalives Load – The load on a link towards the destination based on bits per second MTU – The Maximum Transmission Unit value of the path.

M. Menelaou IGRP By default, only bandwidth and delay are considered. The other parameters are considered only if enabled via configuration. A link with a higher bandwidth will have a lower metric, and a route with a lower cumulative delay will have a lower metric.

M. Menelaou IGRP IGRP advertises three types of routes: Interior System Exterior

M. Menelaou IGRP

M. Menelaou IGRP IGRP has a number of features that are designed to enhance its stability, such as: Holddowns Split horizons Poison reverse updates

M. Menelaou IGRP To configure the IGRP routing process, use the router igrp configuration command. To shut down an IGRP routing process, use the no form of this command. RouterA(config)#router igrp as-number RouterA(config)#no router igrp as-number

M. Menelaou IGRP

M. Menelaou IGRP

M. Menelaou