Đang chuẩn bị liên kết để tải về tài liệu:
EIGRPRouting Protocols and Concepts – Chapter 9

Không đóng trình duyệt đến khi xuất hiện nút TẢI XUỐNG Tải xuống

Developed in 1985 to overcome RIPv1’s limited hop count -Distance vector routing protocol -Metrics used b IGRP M ti d by bandwidth (used by default) Delay (used by default) Reliability (not used by default) Load (not used by default) -Discontinued support starting with IOS 12.2(13)T & 12.2(R1s4)S | I11111111 CISCO Routing Protocols and Concepts - Chapter 9 ITE PC v4.0 Chapter 1 2007 Cisco Systems Inc. All rights reserved. Cisco Public 1 Introduction In this chapter you will learn to Describe the background and history of EIGRP. Describe the features and operation of EIGRP. Examine the basic EIGRP configuration commands and identity their purposes. Calculate the composite metric used by EIGRP. Describe the concepts and operation of DUAL. Describe the uses of additional configuration commands in EIGRP. Interior Gateway Exterior Gateway Protocols Protocols Distance Vector Routing Link state Routing Protocols Path Vector Protocols Classful RIP IGRP EGP __ 1 Classless RIPv2 1EIGRP 1 OSPFV2 ISIS BGPv4 RIPng EIGRPfor IPv6 OSPFV3 IS-IS for IPv6 BGPv4 for IPv6 ITE PC v4.0 Chapter 1 2007 Cisco Systems Inc. All rights reserved. Cisco Public 2 IGRP to EIGRP EIGRP Roots of EIGRP IGRP -Developed in 1985 to overcome RIPvI s limited hop count -Distance vector routing protocol -Metrics used by IGRP bandwidth used by default Delay used by default Reliability not used by default Load not used by default -Discontinued support starting with IOS 12.2 13 T 12.2 R1s4 S IGRPtoEIGRP Summary of Operations Traditional Distance Vector Routing Protocols Use the Bellman-Ford or Ford-Fulkerson algorithm. Age out routing entries and uses penodie updates Keep track of only the best routes the best path tn a destination network. When a route becomes unavailable the router must wait for a new routing update Slower convergence due Io holddown timers. Enhanced Distance Vector Routing Protocol EIGRP Uses the Diffusing Update Algonthm DUAL . Does not age out routing entries nor uses periodic updates. Maintains a topology table separate from the routing table which includes the best path and any loop-free backup paths When a route becomes unavailable DUAL will use a backup path if one exists in the topology tabla. Faster convergence due to the absence of holddown timers and a system of coordinated .