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

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

- Please refer to the attachment to answer this question. This question was created from homework-i-answer.

- Hi I was looking for a bit of help involving this question Online booksellers have captured a very large portion of the retail book market over the past

- Conduct research on the impact of Medicare over the past decade. Specifically look for recent literature on the Obama Administration Healthcare Act and its