Assume that each node is a router that is connected to one network with
a link cost of 0; for example, A is connected to network N1 with a cost
of 0; B to N2 with a cost of 0, etc. The cost between the routers is
shown in the figure.
A-------3-------C------6------F
| |
| |
8 1
| |
| |
D-------2------E-------2------B
For the network shown in Figure , suppose the DV tables are all
established and then the link C-E fails. How can we give
(a) the tables of A, B, D and F after C and E have reported the news
(b) the tables of A and D after their next mutual exchange
(c) the table of C after A exchanges with it.
Sent via Deja.com http://www.deja.com/
Before you buy.