1. Consider the topology diagram shown.

All links are Ethernet cables. B1 to B3 are switches (they are manageable switches, hence have MAC
address, but this will not make a difference in this problem. The MAC addresses indicated as M1 to
M22.). R1 to R5 are routers. H1 and H2 are hosts All interfaces are configured with network mask
255.255.255.0. All routers run a distance vector routing protocol. Routers connected through
switches are considered to be neighbors (for e.g., R2-B2-R3, R2-B2-R4, R3-B2-R4, R1-B1-R3). The
link costs are the same in both directions and are configured as follows.
R1-R3:10
R1-R2:1
R2-R3:1
R2-R4:1
R3-R4:1
R3-R5:10
R4-R5:1

Assume that the costs given above are the costs to reach the specific networks.
(a) Give a possible value of the routing table entry at each router (give the IP address of the router)
for destination network 22.22.3/24, assuming the routing protocol has converged. Write down the
values u si n g t h e f ormat below. If its a direct connection, write DIRECT in Next Hop column.
Router Next Hop Distance
R1
R2
R3
R4
R5

(b) The link between R2 and B2 fails. Fill in the table below with new costs for the
destination network 22.22.3/24
Router Next Hop Distance
R1
R2
R3
R4
R5

2. You are assigned the class C address 192.168.15.0 and you must support the network below. Use VSLM
to assign IP addresses. Specifically you must show for each subnet, the following:
i. Subnet network and broadcast address
ii. Usable host address range

1
 Student Id:

IT 304 COMPUTER NETWORKS

In-Sem II, WINTER 2022

Instructions:
• Each Question carries 10 marks
• Write your student ID on this sheet and supplement sheets
• Do not apply any routing algorithm to share answers during the exam
• Duration is 1hour 15 mins.
• Write your answers in the space provided but Show all calculations in the
supplementary sheet
3. Consider the network of five routers below, with edge weights labeled. Show the step-by-step operation of
Dijkstra’s algorithm
1. for R3 the network of five routers below, with edge weights labeled. Show the step-by-step
Consider
operation of Dijkstra’s algorithm for R3

4. Consider the network configuration shown in figure below. Assume that each link has the same cost of 1.
Run Bellman-Ford algorithm on this network to compute the routing table forId:nodes A and F. Show A's distance
Student
to all other nodes at each step. 2. Consider the network configuration shown in figure below. Assume that each link has the
same cost of 1.

G
B F

A
H
D
I C D

a. Run Bellman-Ford algorithm on this network to compute the routing table for nodes
Solutions A and F. Show A's distance to all other nodes at each step.

1 (a)
Router Next Hop Distance
R1 22.22.192.2 3
R2 R4 2
R3 R4 2
R4 DIRECT 1
R5 DIRECT 1

(b)

Router Next the

b. Suppose Hop Distance
link A-B goes down. As a result, A advertises a distance of infinity to B.
R1 22.22.1.2
Describe 12 to learn that B is unreachable
in detail a scenario where C takes a long time
R2 22.22.192. 13
R3 DIRECT 1
R4 DIRECT 1
R5 22.22.3.1 1

2
2. VLSM
To support 26+2 hosts on a subnet, a minimum of 5 bits is needed in the host portion of the address. 5 bits result
in 30 possible host addresses (2^5-2). The other 3 bits in the last octet can be added to the default 24-bit Class C
mask. Thus, a 27-bit mask can be used to create the following subnets:-

First, you can use the following URL http://www.vlsmcalc.com to input the given requirements
This is how the interface wuold look after giving inputs. Remember to consider router-router as separate
subnets

When you submit this requirement, you will get the output as follows:

Subnet Needed Allocated

Address Mask Dec Mask Assignable Range Broadcast
Name Size Size
192.168.8.1 -
A 26(+2) 30 192.168.8.0 /27 255.255.255.224 192.168.8.31
192.168.8.30
192.168.8.33 -
B 25(+2) 30 192.168.8.32 /27 255.255.255.224 192.168.8.63
192.168.8.62
192.168.8.65 -
C 20(+2) 30 192.168.8.64 /27 255.255.255.224 192.168.8.95
192.168.8.94
192.168.8.97 -
D 15(+2) 30 192.168.8.96 /27 255.255.255.224 192.168.8.127
192.168.8.126
192.168.8.129 -
E 2(+2) 2 192.168.8.128 /30 255.255.255.252 192.168.8.131
192.168.8.130
192.168.8.133 -
F 2(+2) 2 192.168.8.132 /30 255.255.255.252 192.168.8.135
192.168.8.134
192.168.8.137 -
G 2(+2) 2 192.168.8.136 /30 255.255.255.252 192.168.8.139
192.168.8.138

Verify this with your manual calculations.

3. You can do two-three rounds of routing vector exchange and the tables should converge. You do not have to
do it all nodes. For eg: For A, you need to see what its neighbors have, in multiple rounds. The hop is 1 so it is
fairly a simple problem.

3
4.