# Network Routing Analysis Project

Network Routing Analysis Project

Complete each of the five problems below including the required tables and

submit in Moodle in PDF format.

1. Looking at Figure below, enumerate the paths from y to u that do not contain

any loops.

2. Repeat Problem 1 for paths from x to z, z to u, and z to w.

3. 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 Table 4.3.

Answer:

Step N’

D(t),p(t) D(u),p(u) D(v),p(v) D(w),p(w) D(y),p(y) D(z),p(z)

0 x ∞ ∞ 3,x 6,x 6,x 8,x

1 xv 7,v 6,v 3,x 6,x 6,x 8,x

2 xvu 7,v 6,v 3,x 6,x 6,x 8,x

3 xvuw 7,v 6,v 3,x 6,x 6,x 8,x

4 xvuwy 7,v 6,v 3,x 6,x 6,x 8,x

5 xvuwyt 7,v 6,v 3,x 6,x 6,x 8,x

6 xvuwytz 7,v 6,v 3,x 6,x 6,x 8,x

4. Consider the network shown in Problem above (3). Using Dijkstra’s algorithm,

and showing your work using a table similar to Table 4.3, do the following:

a. Compute the shortest path from t to all network nodes.

b. Compute the shortest path from u to all network nodes.

c. Compute the shortest path from v to all network nodes.

d. Compute the shortest path from w to all network nodes.

e. Compute the shortest path from y to all network nodes.

f. Compute the shortest path from z to all network nodes.

5. Consider the network shown below, and assume that each node initially knows

the costs to each of its neighbors. Consider the distance-vector algorithm and

show the distance table entries at node z.

**5 %**discount on an order above

**$ 150**

Use the following coupon code :

2020Discount

**Category**: sample papers