Routing & Enabling RIP WAN Connections.

Slides:



Advertisements
Similar presentations
Distance Vector Routing Protocols
Advertisements

© 2007 Cisco Systems, Inc. All rights reserved.ICND1 v1.0—-5-1 WAN Connections Enabling RIP.
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.
IP Routing.
Routing Protocols and Concepts – Chapter 7 Sandra Coleman, CCNA, CCAI
Copyright 2002 Year 2 - Chapter 5/Cisco 3 - Module 5 Routing Protocols: IGRP By Carl Marandola.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Introducing Routing.
Chapter 5 IP Routing Routing Sending packets through network from one device to another What must routers know? – Destination address – Neighboring routers.
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
Chapter 22 Network Layer: Delivery, Forwarding, and Routing.
Distance Vector Protocols
CISCO NETWORKING ACADEMY Chabot College ELEC IP Routing Protocol Highlights.
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
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.
Introduction to Routing & Routing Protocol 1. Agenda – - Router Operations – - Static Route – - Default Route – - Dynamic Route – - Class of Dynamic Routing.
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.
Advantages of Dynamic Routing over Static Routing : Advertise only the directly connected networks. Updates the topology changes dynamically. Administrative.
1. 라우팅 기본 개념. To route a router need to know: Destination addresses Sources it can learn from Possible routes Best route Maintain and verify routing information.
Lecture Week 7 RIPv2 Routing Protocols and Concepts.
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.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 RIPv2 Routing Protocols and Concepts – Chapter 7.
© 2002, Cisco Systems, Inc. All rights reserved..
© 2002, Cisco Systems, Inc. All rights reserved. 1 Determining IP Routes.
© 2007 Cisco Systems, Inc. All rights reserved.ICND1 v1.0—-5-1 WAN Connections Routing & Enabling RIP.
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.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Routing Overview.
1 1-Dec-15 S Ward Abingdon and Witney College Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
1 Identifying Static and Dynamic Routes Static Route Uses a route that a network administrator enters into the router manually Dynamic Route Uses a route.
Routing Protocols and Concepts – Chapter 7
 RIP — A distance vector interior routing protocol  IGRP — The Cisco distance vector interior routing protocol (not used nowadays)  OSPF — A link-state.
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.
Year 2 - Chapter 5/Cisco 3 - Module 5 Routing Protocols: IGRP.
RIP v1– Routing Information Protocol RIP Versions –RIP v1 (original version, Doyle ch 5) –RIP v2 (improved version, Doyle ch 7) Simple distance-vector.
Distance Vector Routing Protocols
Routing and routing tables
Dynamic Routing Protocols part2
© 2002, Cisco Systems, Inc. All rights reserved.
Routing Loops.
Routing Protocols and Concepts
DYNAMIC ROUTING.
Routing and Routing Protocols: Routing Static
© 2002, Cisco Systems, Inc. All rights reserved.
Routing Information Protocol
Routing and routing tables
CCNA 2 v3.1 Module 6 Routing and Routing Protocols
CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols
Enabling Static Routing
Dynamic Routing Protocols part2
Distance Vector Routing Protocols
© 2002, Cisco Systems, Inc. All rights reserved.
Chapter 5 RIP version 1 CIS 82 Routing Protocols and Concepts
Distance Vector Routing Protocols
Routing Information Protocol
CIT 384: Network Administration
Routing Protocols and Concepts – Chapter 7
Distance Vector Routing Protocols
Routing Protocols and Concepts – Chapter 7
Distance Vector Routing Protocols
© 2002, Cisco Systems, Inc. All rights reserved.
Distance Vector Routing
CCE1030 Computer Networking
© 2002, Cisco Systems, Inc. All rights reserved.
Presentation transcript:

Routing & Enabling RIP WAN Connections

Objects - RIP OVER VIEW - CHARACTERISTICS - OPERATIONS - LOOPS - LOOPS FREE - CONFIGURATIONS - DEBUG

RIP Overview Distance vector protocol. Routers update every 30 seconds Hop-count metric selects the path Metric = hop count (Maximum is 16 equal-cost paths, if metric >=16 -> infinity.) RIP used UDP – port 520. AD (Administrative Distance) = 120. RIP v1 and RIP v2. Purpose: This figure presents general information about RIP. Emphasize: The figure shows a network. The arrows highlight the path RIP selects. RIP selects the best path based on the shortest hop count, so it ignores the path with the faster T1 links. Be sure that you do not disparage RIP. It was developed in a homogeneous network. If everything is connected via a single media type, then bandwidth-based metrics reduce to hop count. In some cases, RIP is more appropriate than other protocols. It is extremely well tested.

Distance Vector Routing Protocols Purpose: This figure introduces the distance vector routing algorithm, the first of the classes of routing protocols, and outlines how it operates. Emphasize: Distance vector algorithms do not allow a router to know the exact topology of an internetwork. This information is somewhat analogous to the information found on signs at a highway intersection. A sign points toward a road leading away from the intersection and indicates the distance to the destination. Further down the highway, another sign also points toward the destination, but now the distance to the destination is shorter. As long as each successive point on the path shows that the distance to the destination is successively shorter, the traffic is following the best path. Routers pass periodic copies of their routing table to neighboring routers and accumulate distance vectors

Classful Routing Protocol: RIPv1 Classful routing protocols do not include the subnet mask with the route advertisement. Within the same network, consistency of the subnet masks is assumed. Summary routes are exchanged between foreign networks. These are examples of classful routing protocols: RIPv1 IGRP (not now)

Classless Routing Protocol: RIPv2 Classless routing protocols include the subnet mask with the route advertisement. Classless routing protocols support a variable-length subnet mask (VLSM). Summary routes can be manually controlled within the network. These are examples of classless routing protocols: RIPv2 EIGRP OSPF IS-IS

RIP OPERATION

RIP OPERATION Routing table send from R3 to R2 Routing table of R2

RIP OPERATION Routing table send from R2 to R1 Routing table of R2

RIP OPERATION

RIP OPERATION

Routing Loops Net 192.68.3.0/24 down Cause network loops

Solution to Routing Loops: Split Horizon Purpose: This figure introduces the corrective measure known as “split horizon.” The split horizon technique attempts to solve routing loops. Emphasize: The split horizon technique attempts to eliminate routing loops and speed up convergence. The rule of split horizon is that it is never useful to send information about a route back in the direction from which the original packet came. In the example: Router C originally announced a route to network 10.4.0.0 to router B. It makes no sense for router B to announce to router C that router B has access to network 10.4.0.0 through router C. Given that router B passed the announcement of its route to network 10.4.0.0 to router A, it makes no sense for router A to announce its distance from network 10.4.0.0 to router B. Because router B has no alternative path to network 10.4.0.0, router B concludes that network 10.4.0.0 is inaccessible. In its basic form, the split-horizon technique simply omits from the message any information about destinations routed on the link. This strategy relies either on routes never being announced or on old announcements fading away through a timeout mechanism. Split horizon also improves performance by eliminating unnecessary routing updates. Under normal circumstances, sending routing information back to the source of the information is unnecessary. It is never useful to send information about a route back in the direction from which the original information came.

Solution to Routing Loops: Route Poisoning Metric = infinity (16) 1, 95, 133 16 16 - Routers advertise the distance of routes that have gone down to infinity. - The release updates for subnet down is done immediately without having to wait until the periodic (call this the triggered update).

Solution to Routing Loops: Route Poisoning and Poison Reverse Purpose: This figure explains poison reverse. Emphasize: Poison reverse overrides the split-horizon solution. Poison reverse overrides split horizon.

Routing Loops: 192.168.3.0 s2/1 Metric = 1 192.168.3.0 s2/1 Metric = 1 192.168.3.0 F0/0 Metric = 0 192.168.3.0 s2/1 Metric = 1 192.168.3.0 s2/1 Metric = 1 192.168.3.0 F0/0 Metric = 0

Routing Loops 192.168.3.0 s2/0 Metric = 2 192.168.3.0 s2/1 Metric = 16 192.168.3.0 F0/0 Metric = 16 R2 not received 192.168.3.0 F0/0 Metric = 16

Solution to Routing Loops: Hold-Down Timers Metric = 16 Holddown timer(180s) 192.168.3.0 s2/1 Metric = 1 192.168.3.0 F0/0 Metric = 16 R2 R2 not received 192.168.3.0 F0/0 Metric = 16

Solution to Routing Loops: Update Timers Metric = 16 Update timer(30s) 192.168.3.0 s2/1 Metric = 16

Solution to Routing Loops: Update timer - Invalid timer – Flush timer Waiting… (150s) 192.168.3.0 s2/1 Metric = 16 192.168.3.0 s2/1 Update timer(30s) Invalid timer (180s) Waiting… (60s) Flush timer (240s) 192.168.3.0 s2/1 Metric = 16 192.168.3.0 s2/1 Metric = 16

IP Routing Configuration Tasks Router configuration Select routing protocols Specify networks or interfaces Purpose: This figure defines the tasks needed to configure IP routing. Emphasize: This is a general overview of tasks, so the graphic shows both IGRP and RIP in the protocol box. Tell your students that the router is able to route using both RIP and IGRP. It is possible to run IGRP and RIP concurrently. The IGRP information will override the RIP information by default because of IGRP’s administrative distance. However, running IGRP and RIP concurrently does not work well when the network topology changes. Because IGRP and RIP have different update timers, and because they require different amounts of time to propagate routing updates, one part of the network may end up believing IGRP routes and another part may end up believing RIP routes. This will result in routing loops. Review the fundamentals of router-configuration and interface-configuration modes. Transition: The command to enable dynamic routing follows.

RIPv1 and RIPv2 Comparison Routing protocol Classful Classless Supports variable-length subnet mask? No Yes Sends the subnet mask along with the routing update? Addressing type (update route) Broadcast 255.255.255.255 Multicast 224.0.0.9 Defined in … RFC 1058 RFCs 1721, 1722, and 2453 Supports manual route summarization? Authentication support? Purpose: This figure presents general information about RIP. Emphasize: The figure shows a network. The arrows highlight the path RIP selects. RIP selects the best path based on the shortest hop count, so it ignores the path with the faster T1 links. Be sure that you do not disparage RIP. It was developed in a homogeneous network. If everything is connected via a single media type, then bandwidth-based metrics reduce to hop count. In some cases, RIP is more appropriate than other protocols. It is extremely well tested.

RIP Configuration Starts the RIP routing process Enables RIP version 2 RouterX(config)# router rip Starts the RIP routing process RouterX(config-router)# version 2 Enables RIP version 2 Purpose: This figure presents the Cisco IOS™ commands used to configure RIP. Emphasize: The figure shows the router rip command and the network network-number command. A proper understanding of these commands will save many problems in the lab. Point out that the network statement contains no subnetting information. Networks are directly connected and are specified as a Class A, B, or C network number. Transition: An example of configuration follows. RouterX(config-router)# network network-number Selects participating attached networks Requires a major classful network number

RIP Configuration Example Purpose: The figure shows how the RIP commands operate on the example network. Emphasize: An administrator only specifies directly connected networks that should be published to other routers. Without the network command, nothing is advertised. With a network command, the router will advertise every subnet within the Class A, B, or C network specified in the configuration.

Verifying the RIP Configuration Routing Protocol is "rip" Sending updates every 30 seconds, next due in 6 seconds Invalid after 180 seconds, hold down 180, flushed after 240 Outgoing update filter list for all interfaces is not set Incoming update filter list for all interfaces is not set Redistributing: rip Default version control: send version 2, receive version 2 Interface Send Recv Triggered RIP Key-chain FastEthernet0/0 2 2 Serial0/0/2 2 2 Automatic network summarization is in effect Maximum path: 4 Routing for Networks: 10.0.0.0 172.16.0.0 Routing Information Sources: Gateway Distance Last Update 10.1.1.2 120 00:00:25 Distance: (default is 120) RouterA# Purpose: This figure shows how the show ip protocol command is used to monitor RIP operation. Emphasize: The command displays the routing protocols that are active on the router for IP. It also gives network and timer information. Point out the timing information. Point out the list of networks for which the router is injecting routes. Point out the administrative distance metric.

Displaying the IP Routing Table RouterA# show ip route Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile, B - BGP D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inter area N1 - OSPF NSSA external type 1, N2 - OSPF NSSA external type 2 E1 - OSPF external type 1, E2 - OSPF external type 2, E - EGP i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - candidate default U - per-user static route, o - ODR T - traffic engineered route Gateway of last resort is not set 172.16.0.0/24 is subnetted, 1 subnets C 172.16.1.0 is directly connected, fastethernet0/0 10.0.0.0/24 is subnetted, 2 subnets R 10.2.2.0 [120/1] via 10.1.1.2, 00:00:07, Serial0/0/2 C 10.1.1.0 is directly connected, Serial0/0/2 R 192.168.1.0/24 [120/2] via 10.1.1.2, 00:00:07, Serial0/0/2 Purpose: This figure displays the show ip route command, which displays the contents of the router’s IP routing table. Emphasize: Discuss the IP routing table in detail. Show the locations of the hop count (metric) and the administrative distance (120). Discuss the following fields: R—Refers to routes learned from RIP. via—Refers to the router that informed us about this route. 00:00:07 timer value—RIP updates are every 30 seconds. Ask, “How long until the next update?” The interfaces used for the best path

debug ip rip Command RouterA# debug ip rip RIP protocol debugging is on RouterA# 00:06:24: RIP: received v1 update from 10.1.1.2 on Serial0/0/2 00:06:24: 10.2.2.0 in 1 hops 00:06:24: 192.168.1.0 in 2 hops 00:06:33: RIP: sending v1 update to 255.255.255.255 via FastEthernet0/0 (172.16.1.1) 00:06:34: network 10.0.0.0, metric 1 00:06:34: network 192.168.1.0, metric 3 00:06:34: RIP: sending v1 update to 255.255.255.255 via Serial0/0/2 (10.1.1.1) 00:06:34: network 172.16.0.0, metric 1 Purpose: This figure shows the debug ip rip command. Emphasize: Explain that debug commands also provide information for monitoring IP. The first highlighted line lists the source of the updates. The router returned information about two destinations. The last highlighted line shows the broadcast address to which the router sent updates.

Summary Routing is the process by which items get from one location to another. Dynamic routing protocols determine how updates are conveyed, what knowledge is conveyed, when to convey knowledge, and how to locate recipients of the updates. A routing protocol that has a lower administrative value is more trustworthy than a protocol that has a higher administrative value. There are three classes of routing protocols: distance vector, link-state, and balanced hybrid. The ip classless command can be used to prevent a router from dropping a packet that is destined for an unknown subnetwork of a directly attached network if a default route is configured. Purpose: This slide discuss the initial configurations on the routers and switches. Note: There is no setup mode on the Catalyst 1900 switch.

Summary (Cont.) RIP is a distance vector routing protocol that uses hop count as the matrix for route selection and broadcasts updates every 30 seconds. RIPv1 uses classful routing protocol; RIPv2 uses classless routing protocol. RIPv2 supports VLSM, manual route summarization, and authentication; RIPv1 does not support these activities. To enable a dynamic routing protocol, first a routing protocol is selected, then IP network numbers are assigned without values being specified (except OSPF). The router command starts the routing process. The network command allows the routing process to determine which interfaces will participate in sending and receiving the routing updates. Purpose: This slide discuss the initial configurations on the routers and switches. Note: There is no setup mode on the Catalyst 1900 switch.

Summary (Cont.) The router RIP command selects RIP as the routing protocol. The network command identifies a participating attached network. The show ip command displays information about routing protocols and the routing table. The debug ip rip command displays information on RIP routing transactions. Purpose: This slide discuss the initial configurations on the routers and switches. Note: There is no setup mode on the Catalyst 1900 switch.