What is the solution to this problem Thanks Please provide a

What is the solution to this problem? Thanks! Please provide answer in same form as the one given here: http://www.chegg.com/homework-help/computer-networks-a-systems-approach-5th-edition-chapter-3-problem-48e-solution-9780123850591

1. C Perform the link ? state algorithm for node D

Solution

Link State Algorithm:

The link state algorithm uses the available information in producing the best route which is optimal. Here, each node shares its link information to all other nodes to build a network topology. The link information gets updated whenever it goes up and down. When the topology is aviable with all nodes the best hop from the source can be obtained.

The link state algorithm for the given network topology is as follows:

Step

Confirmed

Tentative

1

D(0,-)

2

D(0,-)

B(4,B), E(3,E)

3

D(0,-), E(3,E)

B(4,B), C(13,E), F(6,E)

4

D(0,-), E(3,E), F(6,E)

B(4,B), C(13,E)

5

D(0,-), E(3,E), F(6,E), C(13,E)

B(18,C), A(15,C)

6

D(0,-), E(3,E), F(6,E), C(13,E), A(15,C)

B(16, A)

7

D(0,-), E(3,E), F(6,E), C(13,E), A(15,C), B(16,A)

done

The procedure is as follows:

The link state algorithm is implemented for node D. So, starting from node D, the node B can be reached at a distance 4 to node B and at a distance of 3 from node E.

The node E can be reached at a minimum distance from node D with a minimum distance 3. So, the link from node D to node E is updated.

With node E as intermediate node, the link from E to F with a distance of 6 that is, (3+3) is updated.

Again from E, the node C can be reached at a distance 13.

From node C the node A can be reached at a distance 15. From node A the node B can be reached at a distance 16.

Step	Confirmed	Tentative
1	D(0,-)
2	D(0,-)	B(4,B), E(3,E)
3	D(0,-), E(3,E)	B(4,B), C(13,E), F(6,E)
4	D(0,-), E(3,E), F(6,E)	B(4,B), C(13,E)
5	D(0,-), E(3,E), F(6,E), C(13,E)	B(18,C), A(15,C)
6	D(0,-), E(3,E), F(6,E), C(13,E), A(15,C)	B(16, A)
7	D(0,-), E(3,E), F(6,E), C(13,E), A(15,C), B(16,A)
	done