课件说明BSCIEIGRP增强型igrp.pdfVIP

EIGRP Key Neighbor discovery/recovery Uses o packets between neighbors Reliable Transport Protocol (RTP) Guaranteed, ordered delivery of EIGRP packets to all neighbors DUAL finite-state machine Selects lowest-cost, loop , paths to each destination Protocol-dependent modules (PDMs) EIGRP supports IP, AppleTalk, and Novel Ware. Each protocol has its own EIGRP module and operates tly of any of the others that may be running. The Diffusing Update Algorithm (DUAL) ▪ How does EIGRP determine which routes are loop- ? ▪ Each of A’s neighbors is reporting reachability to E: B with a cost of 10 C with a cost of 10 D with a cost of 30 ▪ These three costs are called the Reported Distance (RD) or Aadvertised Distance (AD); the distance each neighbor is reporting to a given destination The Diffusing Update Algorithm (DUAL) ▪ At A, the total cost to reach E is: 20 through B 25 through C 45 through D ▪ The best of these three paths is the path through B, with a cost of 20 ▪ This is the feasible distance (FD) The Diffusing Update Algorithm (DUAL) ▪ A uses the FD and the RD to determine which paths are loop- ▪ The best path (FD) is used as a ben ark; all paths with RDs lower than the FD cannot contain loops ▪ The algorithm may mark some loop- paths as loops ▪ However, it is guaranteed never to mark a looped path as loop- The Diffusing Update Algorithm (DUAL) ▪ At A: The path through B is the best path (FD), at 20 C can reach E with a cost of 10; 10 (RD) is less than 20 (FD), so this path is loop- . D can reach E with a cost of 30; 30 (RD) is not less than 20 (FD), so EIGRP