Assignment 2

Question 1: Consider the network shown in Figure 1. The figure next to the link represents the links cost. a. b. Please use Dijkstras shortest path algorithm to compute the shortest path from D to all other network nodes. [20 marks] Now consider PIM Dense mode multicast routing. What is the multicast tree used to deliver multicast packets from source node B to receivers E, F, and G? Justify your answer. [20 marks] Now assume users attached to router E leave this multicast group. How the multicast tree will look like? Justify your answer. [10 marks]

c.

3 2 A 4 1

4 1

3 D 3 7 20 4 6 E
Figure 1

H 9 F 2 3 8 G 2 5 4 8

7 6 C 5 2

25

Question 2: (20 marks) Consider distance vector routing. Delay is used as the measured metrics. A network consists of six (6) nodes, Node A to Node F. Node A has three neighboring nodes: B, C, and D. The following vectors have come to router A: from B: (6, 0, 5, 9, 8, 4); from C: (5, 2, 0, 1, 4, 5); from D: (4, 7, 6, 0, 3, 4). The first element of the vector from node X represents the delay from node X to node A, while the second element represents the delay from node X to node B, and so on. The measured delays from node A to B, C and D, are 6, 3, and 5, respectively. What is As new routing table? Give both the outgoing line to use and the expected delay. Question 3: (20 marks) Consider two mobile users currently visiting the same foreign network. Are they allowed to use the same care-of address? Justify your answer.