Term
|
Definition
| A set of routers running the same routing protocol under a single realm of control and authority. |
|
|
Term
|
Definition
| A condition under which, for a route to be considered a backup route, the reported distance received for that route must be less than the feasible distance calculated locally. This logic guarantees a loop-free path. |
|
|
Term
|
Definition
| A route that satisfies the feasibility condition and is maintained as a backup route. |
|
|
Term
|
Definition
| The metric value for the lowest-metric path to reach a destination. |
|
|
Term
|
Definition
| Packets that are sent out at periodic interval to detect neighbors for establishing adjacency and ensuring that neighbors are still available. |
|
|
Term
|
Definition
| The amount of time between the advertisement of hello packets and when they are sent out an interface. |
|
|
Term
|
Definition
| Values that EIGRP uses to calculate the best path. |
|
|
Term
|
Definition
| The distance reported by a router to reach a prefix. |
|
|
Term
|
Definition
| The first next-hop router for the successor route. |
|
|
Term
|
Definition
| The route with the lowest path metric to reach a destination. |
|
|
Term
|
Definition
| A method of reducing a routing table by advertising a less specific network prefix in lieu of multiple more specific network prefixes. |
|
|
Term
|
Definition
| A table used by EIGRP that maintains all network prefixes, advertising EIGRP neighbors for prefixes and path metrics for calculating the best path. |
|
|
Term
|
Definition
| The feasible distance (FD) for a route multiplied by the EIGRP variance multiplier. Any feasible successor’s FD with a metric below the EIGRP level of this is installed into the RIB. |
|
|
Term
|
Definition
| A new method of advertising and identifying interface speeds and delay to account for higher-bandwidth interfaces (20 Gbps and higher). |
|
|
