2018 Scheme 1 N T

MID SEMESTER EXAMINATION-III

Course Title with COMPUTER NETWORKS / 18CS51 Maximum Marks 30 Marks

code
Date and Time No. of Hours 1.0
Course Instructor(s) MS. SOWMYA M. R. /MS. DEEPTHI SHETTY
Instructions to Students
1. Answer any two full questions.
2. Any missing data may assume suitably.

MAX
Q. No Question
MARKS
1. a An ISP is granted the block 16.12.64.0/20. The ISP needs to allocate addresses for eight
organizations with 256 addresses.
a. 4096 addresses 2
Range of addresses in the ISP block - 16.12.64.0/24 – 16.12.79.255/24
b.
16.12.64.0/24 – 16.12.64.255/24
16.12.65.0/24 – 16.12.65.255/24
16.12.66.0/24 – 16.12.66.255/24
16.12.67.0/24 – 16.12.67.255/24
16.12.68.0/24 – 16.12.68.255/24
16.12.69.0/24 – 16.12.69.255/24
16.12.70.0/24 – 16.12.70.255/24 4
16.12.71.0/24 – 16.12.71.255/24

Unallocated addresses:
16.12.72.0/24 – 16.12.79.255/24
1
c. Show the outline of the address distribution and the forwarding table.

1
1. b 7
Network Address/Mask Next-hop address Interface Table 1.1: Forwarding table
140.24.7.192/26 ------------ m1 of R2
140.24.7.0/24 Address of R1 m0
0.0.0.0 Default router m2
Network Address/Mask Next-hop address Interface
140.24.7.0/26 ------------------ m0
140.24.7.64/26 ------------------- m1
140.24.7.128/26 ------------------- m2
0.0.0.0 Deafult router m3
Table 1.2: Forwarding table of R1

Page 1 of 5
 2018 Scheme

Router R2 receives a datagram with the destination address 140.24.7.42. The forwarding table of R2 has
the network addresses and the correspondng interfaces through which the packet has to be forwarded.
The mask of the first network address in the forwarding table of R2 is applied on the destination address in
the datagram. If the network address of the datagram matches the network address in the first row then the
datagram is forwarded through the interface m0. If it does not match hen the next row’s mask is applied on
the datagram’s destination address.
1st row from R2’s table:
140.24.7.192/26 - 10001100 00011000 00000111 11
When the /26 is applied on the datagram - 10001100 00011000 00000111 00.
The network addresses do not match.

When checked with the next row’s network address 140.24.7.0/24, the /24 is applied on the destination
address 140.24.7.42, we obtain 10001100 00011000 00000111
And the network address in the 2nd row is 10001100 00011000 00000111.
Both match and hence the datagram will be forwarded to R1 through interface m0.

Now, R1 receives the datagram.

The first network address in the forwarding table of R1 is 140.24.7.0/26.
When /26 is applied on the destination address we obtain –
10001100 00011000 00000111 00 which matches the network address 140.24.7.0/26 (1st row in the
R1’s table).
This way the datagram with the destination address 140.24.7.42 is forwarded to Organization 1.

2. a Consider a sample internet shown in Fig 2. Apply Dijkstra’s algorithm to find the shortest path 8
tree and the forwarding table for node D.

Fig 2: Sample Internet shown as weighted graph

A B C E F G
{D} 3 ∞ 6 3 ∞ ∞

{D,A} - 7 6 3 ∞ ∞

Page 2 of 5
 2018 Scheme

{D,A,E} - 7 6 - 5 ∞

{D,A,E,F} - 7 6 - - 10

{D,A,E,F,C} - 7 - - - 10

{D,A,E,F,C,B} - - - - - 10
{ D,A,E,F,C,B,G} - - - - - -

2. b MTU over a link is 1500Bytes from one router to node. 2

The size of the datagram is 4000 Bytes.
Number of fragments generated will be 3.
1st fragment – 1500 Bytes
2nd fragment – 1500 Bytes
3rd fragment – 1000 Bytes

The 16-bit identification field identifies a datagram originating from the source host. The
combination of the identification and source IP address must uniquely define a datagram as it
leaves the source host. To guarantee uniqueness, the IP protocol uses a counter to label the
datagrams. The counter is initialized to a positive number.
When the IP protocol sends a datagram, it copies the current value of the counter to the
identification field and increments the counter by one. As long as the counter is kept in the main
memory, uniqueness is guaranteed. When a datagram is fragmented, the value in the identification
field is copied into all fragments. In other words, all fragments have the same identification
number, which is also the same as the original datagram. The identification number helps the 2
destination in reassembling the datagram. It knows that all fragments having the same
identification value should be assembled into one datagram.

2c. Path vector –

Each node, after the creation of the initial path vector, sends it to all its immediate
neighbours. Each node, when it receives a path vector from a neighbour, updates its path vector
using an equation similar to the Bellman-Ford, but applying its own policy instead of looking for
the least cost. We can define this equation as

Path (x, y) = best {Path (x, y), [ (x + Path (v, y)]} for all v’s in the internet.

Distance Vector –
Page 3 of 5
 2018 Scheme

In distance-vector routing, the first thing each node creates is its own least-cost tree with the
rudimentary information it has about its immediate neighbours.
Dxy = min {(cxa + Day), (cxb + Dby), (cxc + Dcy), …}

3. a

Fig3: Sample Internet

4
Apply Bellman ford equation

A
A 0
B 3 B
C 5 A 3
D 6 B 0
C 2
D 5
C
A 5
D
B 2
A 6
C 0
B 5
D 4
C 2
D 0

After 1st update:

A B C D 4
A 0 3 5 1
B 3 0 2 4
C 5 2 0 2
D 1 4 4 0
3. b Categorize the Congestion control mechanisms and describe the different mechanisms used in 7
each category.
Solution:
Congestion control mechanisms:
1. Open-loop congestion control (prevention)
2. Closed-loop congestion control (removal).
The different policies and mechanisms used in each category:
Open-Loop Congestion Control:
In open-loop congestion control, policies are applied to prevent congestion before it happens.
• Retransmission Policy
• Window Policy
• Acknowledgment Policy
• Discarding Policy

Page 4 of 5
2018 Scheme

• Admission Policy
Closed-Loop Congestion Control
Closed-loop congestion control mechanisms try to alleviate congestion after it happens.
• Backpressure

• Choke Packet

• Implicit Signaling
• Explicit Signaling

Faculty Signature Course Coordinator/Mentor HoD Signature

Signature

MS. SOWMYA M. R./ MS. DEEPTHI DR. DILEEP REDDY BOLLA DR. SAROJADEVI H.
SHETTY

Page 5 of 5