## What’s a “good” path?

What is the definition of a “good” path for a routing protocol? Chose the best single answer.

## Dijkstra’s link-state routing algorithm.

Consider Dijkstra’s link-state routing algorithm that is computing a least-cost path from node a to other nodes b, c, d, e, f. Which of the following statements is true. (Refer to Section 5.2 in the text for notation.)

## What type of routing?

Match the name of a general approach to routing with characteristics of that approach.

## Dijkstra’s link-state routing algorithm (Part 1).

Consider the graph shown below and the use of Dijkstra’s algorithm to compute a least cost path from a to all destinations. Suppose that nodes b and d have already been added to N’. What is the next node to be added to N' (refer to the text for an explanation of notation).

[Note: You can find more examples of problems similar to this here.]

## Dijkstra’s link-state routing algorithm (Part 2).

Consider the graph shown below and the use of Dijkstra’s algorithm to compute a least cost path from a to all destinations. Suppose that nodes b and d have already been added to N’. What is the

*path cost*to the next node to be added to N' (refer to the text for an explanation of notation).[Note: You can find more examples of problems similar to this here.]