COMP 3331/9331 Computer Networks and Applications
Network Control Plane – Answers
(a) The shortest path routes from F to all the destinations have been shown as thick lines in Figure 1 in the question. The operation of Dijkstra¡¯s algorithm is shown in the following table:
(b) The destination table for Distance Vector in B is shown below:
Copyright By https://powcoder.com 加微信 powcoder
Q2. Consider the network shown in Figure 2 and assume that each node initially knows the costs to each of its neighbours. Consider the distance vector algorithm and show the distance table entries at node z.
COMP 3331/9331 Computer Networks and Applications
Figure 2 Network topology for Q8 Answer: The distance table in z is:
Q3. Consider the count-to-infinity problem in the distance vector routing. Will this problem occur if we decrease the cost of a link? How about if we connect two nodes which do not have a link?
Answer: No, decreasing the cost of a link would not result in the count-to-infinity problem. Connecting two nodes is equivalent to decreasing the link weight from
COMP 3331/9331 Computer Networks and Applications infinite to a finite value.