Question

3. The following figure shows a network of routers. Also assume that networks N1, N2, etc. are connected to routers A, B, etc., respectively. The cost of each link is shown and that the cost from each router to its directly connected network is 0. Assume that the network runs the Distance Vector algorithm. (a) Write the DV table in router B after stabilization. (b) Suppose that the link BE fails, write the new DV table in router B after re-stabilization. (c) Suppose that the link EF also fails (in addition to BE), write the new DV table in router B after re- stabilization. Note: Write only the final tables - no need to show the intermediate steps. 2 3 A D 3 2 B 1 3 E 1 C F 2 4. The following figure shows a network of routers running the link state routing algorithm. The numbers on the links represent costs. Assume that R1 is directly connected to a network N1 with a cost of 0, R2 to N2, etc. Write the link state database (topology information database) that will be stored in each router after flooding. R2 4 R3 1 R4 5 R1 2 6 3 7 R6 R5 8

          3. The following figure shows a network of routers. Also assume that networks N1, N2, etc. are connected
to routers A, B, etc., respectively. The cost of each link is shown and that the cost from each router to its
directly connected network is 0. Assume that the network runs the Distance Vector algorithm.
(a) Write the DV table in router B after stabilization.
(b) Suppose that the link BE fails, write the new DV table in router B after re-stabilization.
(c) Suppose that the link EF also fails (in addition to BE), write the new DV table in router B after re-
stabilization.
Note: Write only the final tables - no need to show the intermediate steps.
2
3
A
D
3
2
B
1
3
E
1
C
F
2
4. The following figure shows a network of routers running the link state routing algorithm. The
numbers on the links represent costs. Assume that R1 is directly connected to a network N1 with a cost
of 0, R2 to N2, etc. Write the link state database (topology information database) that will be stored in
each router after flooding.
R2
4
R3
1
R4
5
R1
2
6
3
7
R6
R5
8

3. The following figure shows a network of routers. Also assume that networks N1, N2, etc. are connected
to routers A, B, etc., respectively. The cost of each link is shown and that the cost from each router to its
directly connected network is 0. Assume that the network runs the Distance Vector algorithm.
(a) Write the DV table in router B after stabilization.
(b) Suppose that the link BE fails, write the new DV table in router B after re-stabilization.
(c) Suppose that the link EF also fails (in addition to BE), write the new DV table in router B after re-
stabilization.
Note: Write only the final tables - no need to show the intermediate steps.
2
3
A
D
3
2
B
1
3
E
1
C
F
2
4. The following figure shows a network of routers running the link state routing algorithm. The
numbers on the links represent costs. Assume that R1 is directly connected to a network N1 with a cost
of 0, R2 to N2, etc. Write the link state database (topology information database) that will be stored in
each router after flooding.
R2
4
R3
1
R4
5
R1
2
6
3
7
R6
R5
8

Added by Brian T.

Question

Please give Ace some feedback