Chapter 3 - EIGRP CMPSC 357 (CCNA 3) Spring 2008.

Slides:



Advertisements
Similar presentations
EIGRP Explanation & Configuration By Bill Reed. We Will Examine the features of EIGRP Discuss why EIGRP is known as a Hybrid Routing Protocol Identify.
Advertisements

Enhanced Interior Gateway Routing Protocol (EIGRP) Part 2
Routing Protocols and Concepts – Chapter 9
EIGRP Brigham Young University- Idaho CIT 340. EIGRP EIGRP Concepts EIGRP Configuration Troubleshooting Routing Protocols.
Copyright 2002 Year 2 - Chapter 5/Cisco 3 - Module 5 Routing Protocols: IGRP By Carl Marandola.
© 2007 Cisco Systems, Inc. All rights reserved.ICND2 v1.0—5-1 EIGRP Implementation Implementing EIGRP.
EIGRP (Enhanced Interior Gateway Routing Protocol)
Implementing an EIGRP-Based Solution
CCNA 2 v3.1 Module 6.
1 CCNA3 – module 3 EIGRP. 2 EIGRP Cisco proprietary, released in 1994 Cisco proprietary, released in 1994 Based on IGRP Based on IGRP EIGRP is an advanced.
Routing and Routing Protocols
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—2-1 Implementing an EIGRP-Based Solution Planning Routing Implementations with EIGRP.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialBSCI Configuring EIGRP BSCI Module 2-1 – Introduction to EIGRP.
Chapter 5 – Routing Protocols: IGRP. Building a Network To Be Reliable – provide error detection and ability to correct errors To Provide Connectivity.
Routing protocols Part III
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
Chapter 22 Network Layer: Delivery, Forwarding, and Routing.
1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.
EIGRP Roots of EIGRP: IGRP
Switching Basics and Intermediate Routing CCNA 3 Chapter 3
CCNA version 1.0 Rick Graziani Cabrillo College
CCNA 3 version 3.1 Rick Graziani Modified Pete Brierley
M. Menelaou CCNA2 DYNAMIC ROUTING. M. Menelaou DYNAMIC ROUTING Dynamic routing protocols can help simplify the life of a network administrator 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.
Chapter 4/Module 3 EIGRP CCNA 3 version 3.0 EIGRP “Enhanced” Interior Gateway Routing Protocol Based on IGRP and developed to allow easy transition from.
CCNA 1 version 3.0 Rick Graziani Cabrillo College
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
Ch. 9 – Basic Router Troubleshooting CCNA 2 version 3.0 Rick Graziani Cabrillo College.
Dynamic Routing Chapter 9. powered by DJ 1. C HAPTER O BJECTIVES At the end of this Chapter you will be able to:  Explain Dynamic Routing  Identify.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 7: Enhanced Interior Gateway Protocol (EIGRP) Scaling Networks.
Routing -2 Dynamic Routing
Ch.16/Mod.7 – Distance Vector Routing Protocols Part 2 of 2: Distance Vector Routing and IGRP.
EIGRP.
Instructor & Todd Lammle
Dynamic Routing Protocol EIGRP Enhanced Interior Gateway Routing Protocol (EIGRP) is an advanced distance vector routing protocol developed by Cisco.
1 13-Oct-15 S Ward Abingdon and Witney College EIGRP CCNA Exploration Semester 2 Chapter 9.
Routing/Routed Protocols Part I. Routed Protocol Definition: Routed Protocol – used to transmit user data (packets) through an internetwork. Routed protocols.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Determining IP Routes.
CCNA 3 version 3.0 Rick Graziani Cabrillo College
Chapter 11 Configuring Enhanced IGRP. Objectives Upon completion of this chapter, you will be able to perform the following tasks: Describe Enhanced IGRP.
Instructor & Todd Lammle
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 3 EIGRP.
1 CCNA 3 v3.1 Module 3. 2 CCNA 3 Module 3 Enhanced Interior Gateway Routing Protocol (EIGRP)
Page 110/27/2015 A router ‘knows’ only of networks attached to it directly – unless you configure a static route or use routing protocols Routing protocols.
Chapter 7 Enhanced IGRP (EIGRP) and Open Shortest Path First (OSPF)
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.
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.
© 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 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 3 EIGRP Cisco Networking Academy.
Saeed Darvish Pazoki – MCSE, CCNA Abstracted From: Cisco Press – ICND 2 – 10 EIGRP 1.
Lecture #4 EIGRP Asst.Prof. Dr.Anan Phonphoem Department of Computer Engineering, Faculty of Engineering, Kasetsart University, Bangkok, Thailand.
Cisco proprietary protocol Classless routing protocol Metric (32 bit) : Composite Metric (BW + Delay) by default. Administrative distance is 90 Updates.
1 8-Dec-15 EIGRP CCNA Exploration Semester 2 Chapter 9.
Chapter 9 EIGRP – Part 2 of 2 CIS 82 Routing Protocols and Concepts Rick Graziani Cabrillo College Last Updated: 4/20/2009.
1 Version 3.1 Module 6 Routed & Routing Protocols.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 3 EIGRP.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 3 EIGRP.
Year 2 - Chapter 5/Cisco 3 - Module 5 Routing Protocols: IGRP.
Routing and Routing Protocols CCNA 2 v3 – Module 6.
Instructor Materials Chapter 7: EIGRP Tuning and Troubleshooting
CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols
EIGRP.
Chapter 5: Dynamic Routing
EIGRP.
EIGRP.
EIGRP.
EIGRP.
Presentation transcript:

Chapter 3 - EIGRP CMPSC 357 (CCNA 3) Spring 2008

Rick Graziani EIGRP “Enhanced” Interior Gateway Routing Protocol Based on IGRP and developed to allow easy transition from IGRP to EIGRP. Cisco proprietary, released in 1994 advanced distance-vector hybrid routing protocol EIGRP is an advanced distance-vector routing protocol that relies on features commonly associated with link-state protocols. (sometimes called a hybrid routing protocol).

Rick Graziani IGRP and EIGRP: A migration path IGRPEIGRP Classful Routing ProtocolClassless Routing Protocol VLSM, CIDR bandwidth = (10,000,000/bandwidth) delay = delay/10 24 bit metric for bandwidth and delay bandwidth = (10,000,000/bandwidth) * 256 delay = (delay/10) * bit metric for bandwidth and delay Maximum Hop Count = 255Maximum Hop Count = 224 No differentiation between internal and external routes. Outside routes (redistributed) are tagged as external routes. (EIGRP tags routes it learns from IGRP or any other source as external routes) Automatic sharing or redistribution between IGRP and EIGRP as long as “AS” numbers are the same. While sharing of route information with OSPF and RIP requires additional configurations.

Rick Graziani Metric Calculation EIGRP bandwidth is in kbps

Rick Graziani Metric Calcuation EIGRP uses bandwidth, delay, reliability and load as its routing metric, Default: bandwidth and delay In short the cost shown in the routing table equates to the link with the slowest bandwidth plus the sum of the delays of all outgoing interfaces from “this router” to the destination network.

Rick Graziani EIGRP and IGRP compatibility Automatic redistribution occurs when the same AS number is used for EIGRP and IGRP. EIGRP scales the IGRP metric by a factor of 256. IGRP reduces the metric by a factor of 256.

Rick Graziani Features of EIGRP Classless Routing Protocol (VLSM, CIDR) Faster convergence times and improved scalability Multiprotocol support: TCP/IP, IPX/SPX, Appletalk Rapid Convergence and Better handling of routing loops –Diffusing Update Algorithm (DUAL) Efficient Use of Bandwidth – Partial, bounded updates: Incremental updates only to the routers that need them. – Minimal bandwidth consumption: Uses Hello packets and EIGRP packets by default use no more that 50% of link’s bandwidth EIGRP packets. PDM (Protocol Dependent Module) – Keeps EIGRP independent from routed protocols – Different PDMs can be added to EIGRP as new routed protocols are enhanced or developed: IPv4, IPv6, IPX, and AppleTalk Unequal-cost load balancing same as IGRP (unlike OSPF)

Rick Graziani EIGRP Terminology – Coming! Neighbor table – Each EIGRP router maintains a neighbor table that lists adjacent routers. This table is comparable to the adjacency database used by OSPF. There is a neighbor table for each protocol that EIGRP supports. Topology table – Every EIGRP router maintains a topology table for each configured network protocol. This table includes route entries for all destinations that the router has learned. All learned routes to a destination are maintained in the topology table. Routing table – EIGRP chooses the best routes to a destination from the topology table and places these routes in the routing table. Each EIGRP router maintains a routing table for each network protocol. Successor – A successor is a route selected as the primary route to use to reach a destination. Successors are the entries kept in the routing table. Multiple successors for a destination can be retained in the routing table. Feasible successor – A feasible successor is a backup route. These routes are selected at the same time the successors are identified, but are kept in the topology table. Multiple feasible successors for a destination can be retained in the topology table.

Rick Graziani Each EIGRP router maintains a neighbor table that lists adjacent routers. This table is comparable to the adjacency database used by OSPF. There is a neighbor table for each protocol that EIGRP supports Whenever a new neighbor is discovered, the address of that neighbor and the interface used to reach it are recorded in a new neighbor table entry. Westasman#show ip eigrp neighbors IP-EIGRP neighbors for process 100 H Address Interface Hold Uptime SRTT RTO Q Seq (sec) (ms) Cnt Num Se0/ :03: Se0/ :34: Neighbor Table

Rick Graziani Topology table –Each EIGRP router maintains a topology table for each configured network protocol. –This table includes route entries for all destinations that the router has learned. –All learned routes to a destination are maintained in the topology table. EIGRP uses its topology table to store all the information it needs to calculate a set of distances and vectors to all reachable destinations. RouterB#show ip eigrp topology IP-EIGRP Topology Table for process 44 Codes: P - Passive, A - Active, U - Update, Q - Query, R - Reply, r - Reply status P /24, 1 successors, FD is via ( / ), Ethernet0 P /24, 2 successors, FD is via ( /284160), Serial0 via ( / ), Ethernet0 Topology Table

Rick Graziani EIGRP chooses the best routes (that is, successor) to a destination from the topology table and places these routes in the routing table. Each EIGRP router maintains a topology table for each network protocol. EIGRP displays both internal EIGRP routes and external EIGRP routes. RouterB#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 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 Gateway of last resort is not set C is directly connected, Serial0 D [90/ ] via , Serial0 D EX [170/ ] via , 00:00:04, Serial0 IP Routing Table

Rick Graziani The routing table contains the routes installed by DUAL as the best loop-free paths to a given destination. EIGRP will maintain up to four routes per destination. These routes can be of equal, or unequal cost (if using the variance command). (later) RouterB#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 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 Gateway of last resort is not set C is directly connected, Serial0 D [90/ ] via , Serial0 D EX [170/ ] via , 00:00:04, Serial0 IP Routing Table

Rick Graziani Four key technologies set EIGRP apart from IGRP EIGRP Technologies

Rick Graziani Establishing Adjacencies with Neighbors EIGRP routers establish adjacencies with neighbor routers by using small hello packets. Hellos are sent every 5 seconds by default K values must be the same between neighbors. An EIGRP router assumes that, as long as it is receiving hello packets from known neighbors, those neighbors (and their routes) remain viable. Hold time tells the router how long it should consider the neighbor alive if it has not received any EIGRP packets (Hello, EIGRP updates, etc.) Hold time is normally three times the configured Hello interval. Both the Hello and Hold time intervals are configurable on a per interface basis, and do not have to match neighbor. EIGRP routers exchange routing information the same way as other distance vector routing protocols, but do not send periodic updates. EIGRP updates are only sent when a network is added or removed from the topology database, when the successor for a given network changes, or when the locally used metric is updated. (later) EIGRP, like any other distance-vector routing protocol uses split-horizon.

Rick Graziani Hello Intervals and Default Hold Times Hello Time The interval of Hello Packets Hold Time The interval to wait without receiving anything from a neighbor before considering the link unavailable.

Rick Graziani Establishing Adjacencies with Neighbors By forming adjacencies, EIGRP routers do the following: Dynamically learn of new routes that join their network Identify routers that become either unreachable or inoperable Rediscover routers that had previously been unreachable

Rick Graziani EIGRP is protocol-independent; that is, it doesn’t rely on TCP/IP to exchange routing information the way RIP, IGRP, and OSPF do. To stay independent of IP, EIGRP uses the transport- layer protocol to guarantee delivery of routing information: RTP. RTP supports reliable and unreliable delivery RTP is used for EIGRP queries, updates and replies RTP is not used for EIGRP Hello’s and Ack’s Reliable Transport Protocol (RTP)

Rick Graziani The centerpiece of EIGRP is DUAL, the EIGRP route- calculation engine. –The full name of this technology is DUAL finite state machine (FSM). –This engine contains all the logic used to calculate and compare routes in an EIGRP network. What is FSM? An FSM is an abstract machine, not a mechanical device with moving parts. FSMs define a set of possible states something can go through, what events causes those states, and what events result from those states. Designers use FSMs to describe how a device, computer program, or routing algorithm will react to a set of input events. DUAL FSM

Rick Graziani DUAL selects alternate routes quickly by using the information in the EIGRP tables. If a link goes down, DUAL looks for a feasible successor in its neighbor and topology tables. A successor is a neighboring router that is currently being used for packet forwarding, provides the least-cost route to the destination, and is not part of a routing loop. Feasible successors provide the next lowest-cost path without introducing routing loops. –Feasible successor routes can be used in case the existing route fails; packets to the destination network are immediately forwarded to the feasible successor, which at that point, is promoted to the status of successor. Selects a best loop-free path to a destination, the next hop being known as the successor. All other routers to the same destination, that also meet the feasible condition, meaning they are also loop-free (later), become feasible successors, or back-up routes. debug eigrp fsm DUAL FSM – Explained in a moment…

Rick Graziani EIGRP is modular Different PDMs can be added to EIGRP as new routed protocols are enhanced or developed: –IPv4, IPv6, IPX, and AppleTalk Protocol-Dependent Modules (PDMs)

Rick Graziani EIGRP routers keep route and topology information readily available in RAM so that they can react quickly to changes. Like OSPF, EIGRP keeps this information in several tables, or databases. –Neighbor table –Topology table –Routing table –Successor –Feasible Successor We will first have an overview of all of the terminology and then see how it works and what it all means! EIGRP Terminology and Operations

Rick Graziani Successor – Current Route –A successor is a route selected as the primary route to use to reach a destination. –Successors are the entries kept in the routing table. Feasible Successor - A backup route –A feasible successor is a backup route. –These routes are selected at the same time the successors are identified, but they are kept in the topology table. –Multiple feasible successors for a destination can be retained in the topology table. Let’s see how this works! EIGRP Terminology and Operations

Rick Graziani Successors and Feasible Successors

Rick Graziani Successors and Feasible Successors

Rick Graziani Successors and Feasible Successors

Rick Graziani Feasible distance (FD) is the minimum distance (metric) along a path to a destination network. Reported distance (RD) is the distance (metric) towards a destination as advertised by an upstream neighbor. Reported distance is the distance reported in the queries, the replies and the updates. A neighbor meets the feasible condition(FC) if the reported distance by the neighbor is smaller than or equal to the current feasible distance (FD) of this router. "If a neighbors metric is less than mine, then I know the neighbor doesn't have a loop going through me." A feasible successor is a neighbor whose reported distance (RD) is less than the current feasible distance (FD). Feasible successor is one who meets the feasible condition (FC). Your route (metric) to the network (RD to me) must be LESS than or EQUAL to my current route (my total metric) to that same network. If your route (metric) to the network (RD to me) is LESS than or EQUAL to my current route (my total metric), I will include you as a FEASIBLE SUCCESSOR. If your route (metric) to the network (RD to me) is MORE than my current route (my total metric), I will NOT include you as a FEASIBLE SUCCESSOR. Successors and Feasible Successors

Rick Graziani Successors and Feasible Successors

Rick Graziani Successors and Feasible Successors Advertised or Destination Feasible Dist. Reported. Dist. Neighbor X In Topology Table Y In Routing Table Z Not in Topology Table Current Successor = 31 RD of RTY= 21 Feasible Successor, FC: RD30 < FD31 FD to is 31 via Router Y RTZ is NOT Feasible Successor, FC: RD220 not< FD31

Rick Graziani Successors and Feasible Successors Current Successor = 31 RD of RTY= 21 Feasible Successor, FC: RD30 < FD31 FD to is 31 via Router Y RTY is successor with a computed cost of 31. “31” is the Feasible Distance (FD). RTX is a feasible successor because its RD is less than or equal to the FD. - RTX’s RD (30) is less than the FD (31). RTZ is NOT Feasible Successor, FC: RD220 not< FD31

Rick Graziani Example of a Loop, What if… Cost=9 Cost=40 RTZ has a Reported Distance to RTA of 220. Since its Reported Distance is greater than RTA’s own Feasibile Distance of 31, RTA can’t trust that the route RTZ takes is somehow back through itself. RTZ FD = 220 RTA to is 31 RTZ to RTA is

Rick Graziani Feasible Successor exists: If current successor route fails, feasible successor becomes the current successor, i.e. the current route. Routing of packets continue with little delay. No Feasible Successor exists: This may be because the Reported Distance is greater than the Feasible Distance. Before this route can be installed, it must be placed in the active state and recomputed. (later) Routing of packets continue but with more of a delay. What if the successor fails?

Rick Graziani Successors and Feasible Successors Current Successor = 40 RD of RTX= 30 New Successor FD to is 40 via Router X RTZ is NOT Feasible Successor, FC: RD220 not< FD31 X Since RTX is the feasible successor, and becomes the successor. RTX is immediately installed from the topology table into the routing table (no recomputation of DUAL). RTA’s new FD via RTX is 40. RTZ is not a feasible successor, because it’s RD (220) is still greater than the new FD (40) for /24.

Rick Graziani Successors and Feasible Successors Current Successor = 40 RD of RTX= 30 FD to is 40 via Router X RTZ is NOT Feasible Successor, FC: RD220 not< FD40 X RTZ is not a feasible successor. It’s RD (220) is greater than the previous FD (40) for /24. Before this route can be installed, the route to net must be placed in the active state and recomputed. Coming soon! X ?

Rick Graziani Successors and Feasible Successors Current Successor = 230 RD of RTZ= 220 FD to is 230 via Router Z RTZ is NOT Feasible Successor, FC: RD220 not< FD40 X After a a series of EIGRP Queries and Replies (coming), and a recomputation of DUAL, RTZ becomes the successor. There is nothing better to prohibit it from being the successor. X

Rick Graziani Topology table Each EIGRP router maintains a topology table for each configured network protocol. This table includes route entries for all destinations that the router has learned. All learned routes to a destination are maintained in the topology table. show ip eigrp topology (Feasible Distance/Reported Distance) 1 successor (route) if FDs are different –smaller FD metric, that route is the the only successor –larger FD metric, those routes are possible feasible successor 2 or more successors (routes) if FDs are the same –Load balancing happens automatically One last reminder….

Rick Graziani Query and Reply Packets EIGRP routers use query packets whenever it needs specific information from one, or all, of its neighbors. –A reply packet is used to respond to a query. If something goes wrong with the successor, DUAL can quickly identify a feasible successor from the topology table, and install a new route to the destination. If no feasible successors to the destination exist, DUAL places the route in the active state. Entries in the topology table can be in one of two states: active or passive. A passive route is one that is stable and available for use. An active route is a route in the process of being recomputed by DUAL. The router multicasts a query to all neighbors, searching for a successor to the destination network. Neighbors must send replies that either provide information on successors, or indicate that no successor information is available.

Rick Graziani Query and Reply Packets RTZ replies that it still has a route to , while RTX and RTY reply that they do not. Current Successor is now RTZ, with a FD of 230 and a RD of RTZ= 220. Routes via RTY and RTX Fail! X ? RTZ was previously NOT a Feasible Successor, FC: RD220 not< FD31 or FD40, but now there is no Sucessor X Queries Replies

Rick Graziani In this scenario… Cost=100 Cost=99Cost=89 RTZ has a Reported Distance to RTA of 220. Since its Reported Distance is greater than RTA’s own Feasibile Distance of 31, RTA can’t trust that the route RTZ takes is somehow back through itself. Queries Replies ? X X All Replies are saying they do not have a route

Rick Graziani X X Replies Router A Router B Router C Router D Queries X X X X X X X X n In some cases, it can take too long for the query to be answered. n When this happens, the router that issued the query gives up and resets its neighbor relationship with the router that didn’t answer. n The most basic situation where this occurs is when it simply takes too long for a query to reach the other end of the network and a reply to travel back. Stuck in Active (SIA)

Configuring EIGRP Much of this information will be discussed further in the Lab

Rick Graziani Configuring EIGRP for IP networks Router(config)#router eigrp autonomous-system-number This value must match all routers within the internetwork. Router(config-router)#network network-number The network command configures only connected networks. Router(config-router)#eigrp log-neighbor-changes This command enables the logging of neighbor adjacency changes to monitor the stability of the routing system and to help detect problems. Router(config-if)#bandwidth kilobits When configuring serial links using EIGRP it is important to configure the bandwidth setting on the interface. If the bandwidth setting is not changed for these interfaces EIGRP assumes the default bandwidth on the link instead of the true bandwidth.

Rick Graziani Summarizing EIGRP Routes: no auto-summary EIGRP automatically summarizes routes at the major boundary, the boundary where the network address ends as defined by class-based addressing.

Rick Graziani Summarizing EIGRP Routes: no auto-summary In the presence of discontiguous subnetworks, automatic summarization must be disabled for routing to work properly. To turn off auto-summarization, use the following command: Router(config-router)#no auto-summary

Rick Graziani Summarizing EIGRP Routes: Interface Summarization Router(config-if)#ip summary-address eigrp autonomous-system-number ip-address mask administrative-distance RTC(config)#router eigrp 2446 RTC(config-router)#no auto-summary RTC(config-router)#exit RTC(config)#interface serial0/0 RTC(config-if)#ip summary-address eigrp

Rick Graziani Summarizing EIGRP Routes: Interface Summarization RTC(config)#interface serial0/0 RTC(config-if)#ip summary-address eigrp RTC’s Routing Table: D /16 is a summary, 00:00:22, Null0 Notice that the summary route is sourced from Null0, and not an actual interface. That is because this route is used for advertisement purposes and does not represent a path that RTC can take to reach that network. On RTC, this route has an administrative distance of 5. RTD is oblivious to the summarization but accepts the route. It assigns the route the administrative distance of a "normal" EIGRP route, which is 90, by default

Rick Graziani There are three ways to inject a default route into EIGRP: Redistribute a static route IP default-network Summarize to /0 EIGRP and Default Routes (Review)

Rick Graziani Redistribute a static route Use the first method when you want to draw all traffic to unknown destinations to a default route at the core of the network. This method is effective for advertising connections to the Internet, but will redistribute all static routes into EIGRP. For example: Gateway Router ip route x.x.x.x (next hop) ! router eigrp 100 redistribute static EIGRP and Default Routes

Rick Graziani ip default-network Propagates a default route to other routers, but needs to have a route or default route out once the packets arrive. Gateway Router router eigrp 24 network ip route ip default-network EIGRP and Default Routes

Rick Graziani Extra: Summarize to /0 Summarizing to a default route is effective only when you want to provide remote sites with a default route. Since summaries are configured per interface, you don't need to worry about using distribute-lists or other mechanisms to prevent the default route from being propagated toward the core of your network. router eigrp 100 network ! interface serial 0 ip address ip summary-address eigrp EIGRP and Default Routes (EXTRA)

Rick Graziani EIGRP show commands

Rick Graziani EIGRP debug commands

Few last items not in the curriculum… This is EXTRA information and will NOT be discussed in class.

Rick Graziani Optional Interface Command: RTA(config-router)# variance number IGRP and EIGRP also support unequal cost path load balancing, which is known as variance. The variance command instructs the router to include routes with a metric less than or equal to n times the minimum metric route for that destination, where n is the number specified by the variance command. Note: If a path isn't a feasible successor, then it isn't used in load balancing. EIGRP variance command

Rick Graziani Let's look at an example, there are three ways to get to Network X, from Router E: (Note: metrics incorrectly not including outgoing interface to Net X.)  E-B-A with a metric of 30  E-C-A with a metric of 20 <<<-- Minimum Metric  E-D-A with a metric of 45 EIGRP variance command

Rick Graziani variance 2 This increases the minimum metric to 40 (2 * 20 = 40). EIGRP includes all the routes that have a metric less than or equal to 40, and are feasible successors. In the above configuration, EIGRP now uses two paths to get to Network X, E-C-A and E-B-A, because both paths have a metric under 40. router eigrp 1 network x.x.x.x variance 2 EIGRP variance command

Rick Graziani Two unequal-cost paths:  E-B-A with a metric of 30 <<<-- Also below 2*20  E-C-A with a metric of 20 <<<-- Minimum Metric  E-D-A with a metric of 45 EIGRP doesn't use path E-D-A because it has a metric of 45, and it's not a feasible successor. Can have up to 6 unequal cost paths. EIGRP variance command router eigrp 1 network x.x.x.x variance 2

Rick Graziani EIGRP Traffic Share To control how traffic is distributed among routes when there are multiple routes for the same destination network that have different costs, use the traffic-share router configuration command. To disable this function, use the no form of the command. traffic-share {balanced | min} no traffic share {balanced | min} balanced Distributes traffic proportionately to the ratios of the metrics. min Uses routes that have minimum costs For more information: a d.shtml

Rick Graziani Redistribution b/t EIGRP & IGRP Same AS numbers Router Two router eigrp 2000 network ! router igrp 2000 network (automatic redistribution) Different AS numbers Router Two router eigrp 2000 redistribute igrp 1000 network ! router igrp 1000 redistribute eigrp 2000 network So what is the difference? We’ll see later when discussing Redistribution.

Rick Graziani OSPFEIGRP Supports CIDR and VLSM, rapid convergence, partial updates, neighbor discovery Administrator can define route summarization Automatic route-summarization and user- defined route summaries Open standard; multivendor supportProprietary; Cisco routers only Scalable; administratively defined “areas” provide manageable hierarchy Scalable, but no hierarchical design Difficult to implementEasy to implement Equal-cost load balancingUnequal-cost load balancing OSPF versus EIGRP

EIGRP and IGRP Metric Review

Rick Graziani The metrics used by EIGRP in making routing decisions are (lower the metric the better): bandwidth delay load reliability By default, EIGRP uses only: Bandwidth Delay Analogies: Think of bandwidth as the width of the pipe and delay as the length of the pipe. Bandwidth is a the carrying capacity Delay is the end-to-end travel time. Metric Calculation

Rick Graziani If these are the default: bandwidth (default) delay (default) When are these used? load reliability Only when configured by the network administrator to do so! EIGRP also tracks (but does not use in its metric calculation): MTU (Maximum Transmission Unit) Hop Count Use show interface command to view the metrics used on a specific interface that is routing EIGRP. These are the raw values. Metric Calculation

Rick Graziani Router> show interfaces s1/0 Serial1/0 is up, line protocol is up Hardware is QUICC Serial Description: Out to VERIO Internet address is /30 MTU 1500 bytes, BW 1544 Kbit, DLY usec, rely 255/255, load 246/255 Encapsulation PPP, loopback not set Keepalive set (10 sec) bandwidthdelay reliabilityload Metric Calculation

Rick Graziani Bandwidth Expressed in kilobits (show interface) This is a static number and used for metric calculations only. Does not necessarily reflect the actual bandwidth of the link. It is an information parameter only. You cannot adjust the actual bandwidth on an interface with this command. Use the show interface command to display the raw value The default values: Default bandwidth of a Cisco interface depends on the type of interface. Default bandwidth of a Cisco serial interface is 1544 kilobits or 1,544,000 bps (T1), whether that interface is attached to a T1 line (1.544 Mbps) or a 56K line. IGRP/EIGRP metric uses the slowest bandwidth of all of the outbound interfaces to the destination network. Metric Calculation

Rick Graziani Changing the bandwidth informational parameter: The bandwidth can be changed using: Router(config-if)# bandwidth kilobits To restore the default value: Router(config-if)# no bandwidth Metric Calculation

Rick Graziani Delay Like bandwidth, delay it is a static number. Expressed in microseconds, millionths of a second (Uses the Greek letter mu with an S,  S, NOT “ms” which is millisecond or thousandths of a second) Use the show interface command to display the raw value It is an information parameter only. The default values: The default delay value of a Cisco interface depends upon the type of interface. Default delay of a Cisco serial interface is 20,000 microseconds, that of a T1 line. IGRP/EIGRP metric uses the sum of all of the delays of all of the outbound interfaces to the destination network. Metric Calculation

Rick Graziani Changing the delay informational parameter: The delay can be changed using: Router(config-if)# delay tens-of-  S (microseconds) Example of changing the delay on a serial interface to 30,000 microseconds: Router(config-if)# delay 3000 To restore the 20,000 microsecond default value: Router(config-if)# no delay Metric Calculation

Rick Graziani IGRP bandwidth = (10,000,000/bandwidth) delay = delay/10 EIGRP bandwidth = (10,000,000/bandwidth) * 256 delay = (delay/10) * 256 Note: The reference-bandwidth For both IGRP and EIGRP: 10 7, (10,000,000/bandwidth kbps), whereas with OSPF it was 10 8 (100,000,000/bandwidth) The difference: IGRP metric is 24 bits long EIGRP metric is 32 bits long EIGRP metric is 256 times greater for the same route EIGRP allows for finer comparison of potential routes Metric Calculation

Rick Graziani EIGRP Metrics Values displayed in show interface commands and sent in routing updates. Calculated values (cumulative) displayed in routing table (show ip route).

Rick Graziani IGRP Metrics Values displayed in show interface commands and sent in routing updates. Calculated values (cumulative) displayed in routing table (show ip route). EIGRP values are 256 times greater.

Rick Graziani Router> show interfaces s1/0 Serial1/0 is up, line protocol is up Hardware is QUICC Serial Description: Out to VERIO Internet address is /30 MTU 1500 bytes, BW 1544 Kbit, DLY usec, rely 255/255, load 246/255 Encapsulation PPP, loopback not set Keepalive set (10 sec) bandwidthdelay reliabilityload Metric Calculation

Rick Graziani Viva la difference! IGRP EIGRP Calculated values (cumulative) displayed in routing table (show ip route). EIGRP values are 256 times greater.

Rick Graziani The metrics used by EIGRP in making routing decisions are (lower the metric the better): bandwidth delay load reliability By default, EIGRP uses only: Bandwidth Delay Reliability and Load

Rick Graziani Reliability Reliability is measure dynamically Uses error rate for measurement Reflects the total outgoing error rates of the interfaces along the route Calculated on a five minute weighted average, so not to allow sudden peaks and valleys to make a significant impact Expressed as an 8 bit number 255 is a 100% reliable link 1 is a minimally reliable link Higher the better! Reliability and Load

Rick Graziani shows reliability as a fraction of 255, for example: rely 190/255 (or 74% reliability) rely 234/255 (or 92% reliability) rely 255/255 (or 100% reliability) Router> show interfaces s1/0 Serial1/0 is up, line protocol is up Hardware is QUICC Serial Description: Out to VERIO Internet address is /30 MTU 1500 bytes, BW 1544 Kbit, DLY usec, rely 255/255, load 246/255 Encapsulation PPP, loopback not set Keepalive set (10 sec) bandwidth delay reliabilityload Reliability and Load

Rick Graziani Load Load is measure dynamically Uses channel occupancy for measurement Reflects the total outgoing load of the interfaces along the route Calculated on a five minute weighted average, so not to allow sudden peaks and valleys to make a significant impact Expressed as an 8 bit number 255 is a 100% loaded link 1 is a minimally loaded link Lower the better! Note: Even though load and reliability are dynamically changing values, EIGRP will not recalculate the route metric when these parameters change. Reliability and Load

Rick Graziani shows load as a fraction of 255, for example: load 10/255 (or 3% loaded link) load 40/255 (or 16% loaded link) load 255/255 (or 100% loaded link) Router> show interfaces s1/0 Serial1/0 is up, line protocol is up Hardware is QUICC Serial Description: Out to VERIO Internet address is /30 MTU 1500 bytes, BW 1544 Kbit, DLY usec, rely 255/255, load 246/255 Encapsulation PPP, loopback not set Keepalive set (10 sec) bandwidth delay reliabilityload Reliability and Load

Rick Graziani IGRP/EIGRP metric = [k1* BW IGRP(minimum) + (k2* BW IGRP(minimum) )/(256-LOAD) + k3* DLY IGRP(sum) ] * [k5/RELIABILITY + k4)] k2 metric effects LOAD k4 and k5 effects RELIABILITY Multiply Reliability only if > 0 Default: k1=k3=1 and k2=k4=k5=0 You may change the k values to change what you want to give more or less weight to. –k1 for bandwidth –k2 for load –k3 for delay –k4 and k5 for Reliability Higher the k value, the more that part of the metric is used to calculate the overall IGRP metric Reliability and Load

Rick Graziani Turning the knobs: We can use the other metrics of Reliability and Load by adjusting their k values to something greater than “0” The command to adjust the k values is: Router(config-router)# metric weights tos k1 k2 k3 k4 k5 Notes: tos is always set to 0; at one time it was Cisco’s intent to use it, but it was never implemented EIGRP neighbors must agree on K values to establish an adjacency and to avoid routing loops. Caution! Know what the impact will be before changing the defaults. It can give you unexpected results if you do not know what you are doing! If you modify the weights, you should configure all routers so they are all using the same weight values. Reliability and Load

Ch.5 - EIGRP CCNP 1 version 3.0 Rick Graziani Cabrillo College