it计算机 深圳职业技术学院计算机系网络专业

2006, Shenzhen Polytechnic. All rights reserved. 1EIGRP深圳职业技术学院计算机系网络专业 2006 Shenzhen Polytechnic. All rights reserved. 2教学目标（ Objectives ）1. EIGRP关键特征（ Key Characteristics of EIGRP ）2. EIGRP三张表（ EIGRP Maintains Three Tables）3.后继和 可行后继（ Successor and Feasible Successor ）4.可行距离和通告距离（ FD and RD ） 5. EIGRP 数据结构（ EIGRP Data Structure）6.配置 EIGRP（ Configuring EIGRP）7.验证 EIGRP（ Verifying EIGRP） 2006 Shenzhen Polytechnic. All rights reserved. 3EIGRP关键特征（ Key Characteristics of EIGRP ）（ 1）是高级距离向量路由协议， CISCO私有协议 It is an enhanced distance vector routing protocol.（ 2）用带宽、延迟、负载、可靠性作为度量值Metric: bandwidth,delay,load,reliability（ 3）支持非等价负载均衡 Uses unequal-cost load balancing. （ 4）最大跳数为 225 Maximum hop is 225（ 5）采用 DUAL算法计算到目的地的最短路径 Uses Diffused Update Algorithm (DUAL) to calculate the shortest path. （ 6）合并了距离向量路由协议和链路状态路由协议优点Uses a combination of distance vector and link-state features（ 7） EIGRP用 “EX”识别外部路由EIGRP will tag routes by EX learned from any outside source as external . 2006 Shenzhen Polytechnic. All rights reserved. 4EIGRP三张表（ EIGRP Maintains Three Tables）1.邻居表（ Neighbor table ）在 EIGRP中，邻居表最为重要The neighbor table is the most important table in EIGRP. 2.拓扑表（ Topology table ）在自治系统中，路由表由拓扑表计算The topology table is made up of all the EIGRP routing tables in the autonomous system. 3.路由表（ Routing table ）路由表是到达目标网络的最佳路径，路由器为每种被路由的协议维护一张拓扑表和路由表。 The EIGRP routing table holds the best routes to a destination. Each EIGRP router maintains a topology table and routing table for each network protocol. 2006 Shenzhen Polytechnic. All rights reserved. 5后继（ Successor ）后继路由器是到达指定目的最优的下一跳邻居路由器A succesor is a neighbor router that is the next hop in a least-cost path to any given destination.后继路由是主要路由。A successor is a route selected as the primary route to use to reach a destination. 2006 Shenzhen Polytechnic. All rights reserved. 6可行后继（ Feasible Successor ）通过指定可行后继路由器， EIGRP路由器在后继路由器失效时，能够马上将该路由安装到路由表By identifying feasible successors,EIGRP router can immediately install alternate route if a successor fail.可行后继是备份路由。A feasible successor (FS) is a backup route. 2006 Shenzhen Polytechnic. All rights reserved. 7可行距离和通告距离（ FD and RD ）1.可行距离是到达目标网络最小的度量值Feasible distance (FD ) is the lowest calculated metric to each destination.2.通告距离是邻居路由器通告它到达目标网络的距离Reported distance (RD) is the distance reported by an adjacent neighbor to a specific destination. 3.可行性条件（ feasible condition）：RDFD 2006 Shenzhen Polytechnic. All rights reserved. 8EIGRP 算法（ EIGRP Algorithm ） 2006 Shenzhen Polytechnic. All rights reserved. 9EIGRP 数据结构（ EIGRP Data Structure） Hello 确认（ Acknowledgment ） 更新（ Update） 查询 （ Query ） 应答 （ Reply ） 2006 Shenzhen Polytechnic. All rights reserved. 10Hello1. EIGRP依靠 hello包来发现、验证和再发现邻居路由器。EIGRP relies on hello packets to discover, verify, and rediscover neighbor routers. 2. EIGRP发送 hello包的周期，称为 hello interval。 EIGRP routers send hellos at a fixed but configurable interval, called the hello interval .3.在 IP网络中， EIGRP路由器使用组播地址 224.0.0.10来发送 hello包。On IP networks, EIGRP routers send hellos to the multicast IP address 224.0.0.10. 4.OSPF需要邻居有相同的 hello和 dead间隔，而 EIGRP没有此限制。 OSPF requires neighbor routers to have the same hello and dead intervals to communicate. EIGRP has no such restriction. 2006 Shenzhen Polytechnic. All rights reserved. 11EIGRP默认 hello间隔和 hold时间（ Default Hello Intervals and Hold Times for EIGRP） 2006 Shenzhen Polytechnic. All rights reserved. 12确认（ Acknowledgment）1.确认包是单播。Acknowledgment packets are unicast.2.确认能被捎带完成，如应答包。Acknowledgments can be made by attaching them to other kinds of EIGRP packets, such as reply packets 2006 Shenzhen Polytechnic. All rights reserved. 13更新（ Update）1.当路由器发现新的邻居时用到更新包。Update packets are used when a router discovers a new neighbor.2. EIGRP 路由器向新的邻居发送单播更新。An EIGRP router sends unicast update packets to that new neighbor .3. EIGRP路由器向所有邻居发送组播更新来通过网络变化。所有的更新包要可靠传输。EIGRP router sends a multicast update packet to all neighbors, which alerts them to the change. All update packets are sent reliably. 2006 Shenzhen Polytechnic. All rights reserved. 14查询和应答（ Query and Reply）1.如果 EIGRP路由器失去后继，并且没有可行后继， DUAL算法将路由置为活跃状态，然后以组播向所有的邻居发送查询包，试图定位后继。邻居路由器必须发送应答包来响应。If an EIGRP router loses its successor and cannot find a feasible successor for a route, DUAL places the route in the Active state. A query is then multicasted to all neighbors in an attempt to locate a successor to the destination network. Neighbors must send replies that either provide information on successors or indicate that no information is available. 2. 查询包可以是组播或单播，应答包一直是单播。Queries can be multicast or unicast, while replies are always unicast. 3. 查询和应答都要可靠传输。Both packet types are sent reliably. 2006 Shenzhen Polytechnic. All rights reserved. 15配置 EIGRP（ Configuring EIGRP） 2006 Shenzhen Polytechnic. All rights reserved. 16EIGRP 自动汇总（ EIGRP Automatically Summarizes） 2006 Shenzhen Polytechnic. All rights reserved. 17配置 EIGRP手工汇总（ Manual Summarization with EIGRP）EIGRP基于接口来用 “summary address”命令手工配置汇总 2006 Shenzhen Polytechnic. All rights reserved. 18配置汇总（ Configure Summary）RTC(config)#router eigrp 2446RTC(config-router)#no auto-summaryRTC(config-router)#exit RTC(config)#interface serial 0/0RTC(config-if)#ip summary-address eigrp 2446 2.1.0.0 255.255.0.0 2006 Shenzhen Polytechnic. All rights reserved. 19验证 EIGRP（ Verifying EIGRP）show ip eigrp neighborsshow ip eigrp topologyShow ip routeShow ip protocolsshow ip eigrp interfacedebug eigrp neighborsdebug eigrp packe