1.3.c i General operations Here’s a quick overview of EIGRP: Distance-vector routing protocol. Transport is IP protocol 88 (does not use TCP or UDP). Also implements it’s own Reliable Transport Protocol (RTP). Hello Timer – Interval at which Hello messages are sent out an interface. Hold Timer – Used to determine when a neighbor has… read more »
EIGRP’s operations can be conceptually simplified into three basic steps: Step 1. Neighbor Discovery: Through the exchange of Hello messages, EIGRP-speaking routers discover one another, compare parameters (for example, autonomous system numbers, K-values, and network addresses), and determine if they should form a neighborship. Step 2. Topology Exchange: If neighboring EIGRP routers decide to form… read more »
1.3d i Equal-cost EIGRP will load balance 4 equal cost paths into the routing table by default. Traffic is shared equally between each path. The number of paths is configurable using the command: max-paths <[1-6]>. Configuration Verification 1.3d ii Unequal-cost EIGRP allows for unequal cost load balancing using the variance command where variance is a… read more »
1.3b i RD, FD, FC, successor, feasible successor RD Reported Distance, the total metric along a path to a destination network as advertised by an upstream router. FD Feasible Distance, the best metric along a path to a destination, includes metric to the neighbour advertising the path. Lowest calculated metric to each destination. FC Feasibility… read more »
EIGRP can be configured in Named mode which simplifies the configuration of EIGRP under one area of config, instead of spread between the router section and all the interfaces.