----------------------------------------------------

Prefix Match Interface

----------------------------------------------------

00 0

01 1

10 2

11 3

----------------------------------------------------

For each of the four interfaces, give the associated range of destination host addresses and the number of addresses in the range.

2. Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to the one shown below.

3. Consider the network shown in Problem 2. Using Dijkstra's algorithm, and showing your work using a table similar to the one shown in Problem 2, do the following:

a) Compute the shortest path from y to all network nodes.

b) Compute the shortest path from t to all network nodes

### Recently Asked Questions

- Most fish do not sink in water because of the presence of swim bladder air bladder air sacs air in spongy bones

- Ben and Sherry started their relationship while they were enrolled in a small Christian liberal arts college. They shared much in common, from their 3.85 grade

- A researcher is investigating how an auxin cytokine mixtureA researcher is investigating how an auxin cytokine mixture affects the development of meristematic