1. 1 Pertemuan 4 EIGRP

2. Discussion Topics EIGRP Concepts EIGRP Configuration 2

3. Comparing EIGRP with IGRP Comparisons between EIGRP and IGRP fall into the following major categories: –Compatibility mode –Metric calculation –Hop count –Automatic protocol redistribution –Route tagging

4. Using EIGRP with IGRP

5. EIGRP and IGRP Metric Calculation

6. Comparing show ip route for EIGRP and IGRP

7. EIGRP Concepts The following three tables are maintained by EIGRP: –Neighbor table –Topology table –Routing table

8. The EIGRP Topology Table

9. EIGRP Concepts Every EIGRP router maintains a topology table for each configured network protocol. All learned routes to a destination are maintained in the topology table.

10. EIGRP Successors and Feasible Successors

11. EIGRP Design Features

12. EIGRP Technologies Neighbor discovery and recovery Reliable Transport Protocol DUAL finite-state machine algorithm Protocol-dependent modules By forming adjacencies, EIGRP routers: –Dynamically learn of new routes that join their network –Identify routers that become either unreachable or inoperable –Rediscover routers that had previously been unreachable

13. Data Structure The five EIGRP packet types are as follows:

14. Default Hello Intervals and Hold Times for EIGRP

15. Feasible Successor Route Selection Rules

16. Configuring EIGRP

17. EIGRP Automatically Summarizes Based on Class

18. Manual Summarization with EIGRP

19. Verifying EIGRP

20. EIGRP debug Commands

21. Building Neighbor Tables

22. Discover Routes

23. Select Routes If a link goes down, DUAL looks for an alternative route path, or feasible successor, in the topology table. If a feasible successor is not found, the route is flagged as Active, or unusable at present. Query packets are sent to neighboring routers requesting topology information. DUAL uses this information to recalculate successor and feasible successor routes to the destination.