《EIGRP01-Introducing EIGRP CCNP英文原版课件》由会员分享，可在线阅读，更多相关《EIGRP01-Introducing EIGRP CCNP英文原版课件（16页珍藏版）》请在金锄头文库上搜索。
1、BSCI v3.02-1Configuring EIGRPIntroducing EIGRP Flexible network design Multicast and unicast instead of broadcast address Manual summarization at any point 100% loop-free classless routing Easy configuration for WANs and LANs Load balancing across equal- and unequal-cost pathways Advanced distance v
2、ector Fast convergence Support for VLSM and discontiguous subnets Partial updates Support for multiple network-layer protocolsEIGRP FeaturesEIGRP Key Technologies Neighbor discovery/recovery Uses hello packets between neighbors Reliable Transport Protocol (RTP) Guaranteed, ordered delivery of EIGRP
3、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.
4、EIGRP Neighbor TableDUAL 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 (Current) succes
5、sor = 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 TableEIGRP IP Routing TableExample: EIGRP TablesRouter C Tables:EIGRP Packets Hello: Establish neighb
6、or 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 DiscoveryEIGRP Metric Same metric components as IGRP: Bandwidth Delay Reliability Loading MTU EIGRP metr
7、ic is IGRP metric multiplied by 256.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
8、 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):A B C D Least bandwidth 64 kbps Total delay 6,000 A X Y Z D Least bandwidth 256 kbps Total del
9、ay 8,000 Delay is the sum of all the delays of the links along the paths: Delay = delay in tens of microseconds x 256 Bandwidth is the lowest bandwidth of the links along the paths: Bandwidth = 10,000,000 / (bandwidth in kbps) x 256EIGRP Metrics Calculation ExampleEIGRP Metrics Are Backward-Compatib
10、le with IGRPSummaryEIGRP capabilities include fast convergence and support for VLSM, partial updates, and multiple network layer protocols.EIGRP key technologies are neighbor discovery/recovery, RTP, DUAL finite-state machine, and PDMs. EIGRP uses three tables: neighbor table, topology table, and ro
11、uting table. The routing table contains the best route to each destination, called the successor route. A feasible successor route is a backup route to a destination; it is kept in the topology table. EIGRP uses the same metric components as IGRP: delay, bandwidth, reliability, load, and MTU. By default, EIGRP metric equals bandwidth (slowest link) plus delay (sum of delays). EIGRP metrics are backward-compatible with IGRP; the EIGRP- equivalent metric is the IGRP metric multiplied by 256.
