Page 142 - Handout Computer Network.

• Cost—An arbitrary value, usually based on bandwidth, monetary expense, or
other measurement, that is assigned by a network administrator.

6.7 Identifying the Classes of Routing Protocols

Most routing algorithms can be classified under one of the following three categories:

• Distance vector

• Link-state

• Balanced hybrid

The distance vector routing protocol approach determines the direction, or the vector,
and the distance to any link in the internetwork.

The link-state routing protocol approach, also called shortest path first (SPF), recreates
the exact topology of the entire internetwork.
The balanced hybrid routing protocol approach combines aspects of the link-state and
distance vector algorithms.
6.7.1 Distance Vector Routing Protocol Features

Distance vector routing algorithms pass periodic copies of a routing table from router to
router. These regular updates between routers communicate topology changes.

Distance vector–based routing algorithms also are known as Bellman-Ford algorithms. In
Figure 6-13 shown a Distance Vector Concepts, each router receives a routing table from its
neighboring routers. Router B receives information from Router A. Router B adds a distance
vector number, such as a number of hops, which increases the distance vector. Then Router B
passes this new routing table to its other neighbor, Router C. This step-by-step process occurs
in all directions between all neighbor routers.

162