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.

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.

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.