These metrics will be discussed later or in CCNP Advanced Routing, with their appropriate Routing Protocols: RIP hop

op count IGRP bandwidth, delay, reliability, load EIGRP bandwidth, delay, reliability, load OSPF bandwidth BGP attribute values and shortest path

Most routing algorithms can be classified as one of two basic algorithms: distance vector link state. The distance-vector routing approach determines the direction (vector) and the cost or metric (distance) to any link in the internetwork. RIP, IPX RIP and IGRP (CCNA) AppleTalk, RTMP and others (non-CCNA)

The link-state (also called shortest path first) approach re-creates the exact topology of the entire internetwork (or at least the portion in which the router is situated). OSPF IS-IS

The balanced hybrid approach combines aspects of the linkstate and distance-vector algorithms. These are really distance-vector routing protocols which apply some of the advantages of a link-state routing protocols, and also known as advanced-distance-vector routing protocols. EIGRP

When all routers in an internetwork are operating with the same knowledge, the internetwork is said to have converged. Fast convergence is a desirable network feature because it reduces the period of time in which routers would continue to make incorrect/wasteful routing decisions.