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

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

## This question was asked on Dec 04, 2010.

### Recently Asked Questions

- I need help with this discussion activity. Visit the Fed's Summary of Commentary on Current Economic Conditions (Links to an external site.)Links to an

- Can anyone please assist with answering these questions? 1-10

- Which of the following statements are true (T) and which are false (F)? If X = 3 and Y = 4, the constraint 2 X + 8 Y <= 38 is satisfied (not violated).