Term
|
Definition
| The time between the initiation of a transaction by a sender and the first response that the sender receives. Also, the time required to move a packet form source to destination over a given path. |
|
|
Term
|
Definition
| Diffusing Update Algorithm- Covergence lagorithm used in EIGRP that provides loop-free operation at every instant throughout a route computation. Allows routers involved in a topology change to synchroniz at the same time, while not involving routers that are unaffected by the change. |
|
|
Term
|
Definition
| Feasible distance- The lowest calculated metric to each destination. |
|
|
Term
|
Definition
| feasible successor- A backup route. These routes are identified at the same time that the successors are identified but are kep only in the topology table. |
|
|
Term
|
Definition
| The table that routers running EIGRP use to maintain lists of adjacent routers. There is a neighbor table for each protocol that EIGRP supports. |
|
|
Term
|
Definition
| reported distance- the distance that an adjacent neighbor reports to a specific destination. |
|
|
Term
| Reliable Transport Protocol |
|
Definition
| A transport-layer protocol that can guarantee ordered delivery of EIGRP packets to all neighbors. |
|
|
Term
|
Definition
| This refers to the state of a router if one or more routers to which a query is sent do not respond with a reply within the active time of 80 seconds(3 minutes). |
|
|
Term
|
Definition
| A route that is selected as the primary route to sue to reach a destination. |
|
|
Term
|
Definition
| The table that is made up of all the EIGRP routing tables in the autonomous system to provide the router with knowledge of all the destination routes witht eh autonomous system. |
|
|
