【ROUTE 1-2】Introducing EIGRP.pptVIP

EIGRP Features EIGRP Key Technologies Neighbor discovery/recovery Uses hello packets between neighbors Reliable Transport Protocol (RTP) Guaranteed, ordered delivery of EIGRP packets to all neighbors. DUAL finite-state machine Selects lowest-cost, loop free, paths to each destination Protocol-dependent modules (PDMs) EIGRP supports IP, AppleTalk, and Novell NetWare. Each protocol has its own EIGRP module and operates independently of any of the others that may be running. EIGRP Neighbor Table DUAL Terminology Selects lowest-cost, loop-free paths to each destination. AD = cost between the next-hop router and the destination . FD = cost from local router = AD of next-hop router + cost between the local router and the next-hop router. Lowest-cost = lowest FD. Successor = next-hop router with lowest-cost, loop free path. Feasible successor = backup router with loop-free path (AD of feasible successor must be less than FD of current successor route). EIGRP Topology Table EIGRP IP Routing Table Example: EIGRP Tables EIGRP Packets Hello: Establish neighbor relationships. Update: Send routing updates. Query: Ask neighbors about routing information. Reply: Respond to query about routing information. ACK: Acknowledge a reliable packet. Initial Route Discovery EIGRP Metric EIGRP Metric Calculation By default, EIGRP metric: Metric = bandwidth (slowest link) + delay (sum of delays) Delay = sum of the delays in the path, in tens of microseconds, multiplied by 256 Bandwidth = [107 / (minimum bandwidth link along the path, in kilobits per second)] * 256 Formula with default K values (K1 = 1, K2 = 0, K3 = 1, K4 = 0, K5 = 0): Metric = [K1 * BW + ((K2 * BW) / (256 – load)) + K3 * delay] If K5 not equal to 0: Metric = metric * [K5 / (reliability + K4)]: EIGRP Metrics Calculation Example EIGRP Metrics Are Backward-Compatible with IGRP http://bbs.SPOTO.net * ? 2010 SPOTO CCNP LAB All rights reserved. SPOTO v1.0 Introducing EIGRP Flexible(灵活的) network design Multicast and unicast inst