Question

4. (15 pts) Distance Vector Routing Consider the network configuration shown in Figure 3, where the routers calculate shortest routes using the Distance Vector Routing Protocol with poisoned reverse method. 4 6 A B C 7 1 2 10 D 8 5 E X 1 F G 10 Figure 3: Graph Initially, the router tables for routes to node E (E is the only destination in this problem) look like the following: Cost Next Cost Next Cod Net Cost A B C D F F G Cost Next Cost Next Cost Next Cost Next Cost Next Cost Next Cost Next 10 D 7 C 3 G 9 G 0 --- 11 G 1 E Figure 4: Routing Table Now, assume the link connecting E and G goes down. Show how the distance vector algorithm with the poisoned reverse method builds the routing table to node E. Assume that simultaneous updates are carried out at all nodes.

          4. (15 pts) Distance Vector Routing Consider the network configuration shown in Figure 3, where the
routers calculate shortest routes using the Distance Vector Routing Protocol with poisoned reverse
method.
4
6
A
B
C
7
1
2
10
D
8
5
E
X
1
F
G
10
Figure 3: Graph
Initially, the router tables for routes to node E (E is the only destination in this problem) look like the
following:
Cost Next Cost Next Cod Net Cost
A
B
C
D
F
F
G
Cost Next Cost Next Cost Next Cost Next Cost Next Cost Next Cost Next
10 D
7
C
3
G
9
G 0
---
11 G
1
E
Figure 4: Routing Table
Now, assume the link connecting E and G goes down. Show how the distance vector algorithm with
the poisoned reverse method builds the routing table to node E. Assume that simultaneous updates are
carried out at all nodes.

4. (15 pts) Distance Vector Routing Consider the network configuration shown in Figure 3, where the
routers calculate shortest routes using the Distance Vector Routing Protocol with poisoned reverse
method.
4
6
A
B
C
7
1
2
10
D
8
5
E
X
1
F
G
10
Figure 3: Graph
Initially, the router tables for routes to node E (E is the only destination in this problem) look like the
following:
Cost Next Cost Next Cod Net Cost
A
B
C
D
F
F
G
Cost Next Cost Next Cost Next Cost Next Cost Next Cost Next Cost Next
10 D
7
C
3
G
9
G 0
—
11 G
1
E
Figure 4: Routing Table
Now, assume the link connecting E and G goes down. Show how the distance vector algorithm with
the poisoned reverse method builds the routing table to node E. Assume that simultaneous updates are
carried out at all nodes.

Added by Bobby C.

Question

Please give Ace some feedback