RollNo.

[n|e |20 |Slo

|6 [ [0 B
ANNA UNIVERSITY (UNIVERSITY DEPARTMENTS)
Nov/bpee
B'E./B. Tech/ B. Arch (Full Time) - END SEMESTER EXAMINATIONS, i\l .o, © 2022
INFORMATION TECHNOLOGY
V Semester
1T5551 COMPUTER NETWORKS
(Regulation 2019)
Time: 3hrs Max.Marks: 100
CO 1_| Highlight the significance of the functions of each layer in the network.
CO2 | Identify Ihe devices and protocols to design a network and implement it.
CO3T"Build nelwork applications using the right set of protocols and estimate their performances.
CO4 | Trace packet flows and interpret packet formals.
COS5 | Apply addressing principles such as subnetting and VLSM for efficient routing.
CO6 | Explain media access and communication techniques.
L - Bloom’s Taxonomy Levels
(L1 - Remembering, L2 - Understanding, L3 - Applying, L4 - Analysing, L5 - Evaluating, L6 - Creating)

PART- A (10 x 2 = 20 Marks)

(Answer all Questions)

Q. No Questions Marks | CO | BL
1 Differentiate between a modem, a switch and a router. 200212
2 Why is it that in today's internet, applications like YouTube which carry 2| CO3 (L4
voice and video traffic use TCP rather than UDP?
3 A data path (physical link) has one way latency of 50ms, and a bandwidth | 2 | CO1
L2
of 45 Mbps. Calculate the maximum number of bits that can be packed
within the path.
4 What would be the effect of a router randomly dropping packets from
| 2 [ CO4 L2
TCP flows ?
5 Suppose that routers were subjected to conditions that might cause
them | 2 | CO1 | L4
to fail often. Would this argue in favor of a VC or datagram approac
h?
Justify your answer.
6 Interpret the following IP addresses:
[2]cos| L3
(i) 200.34.56.1 (ji) 127.100.0.1 (iii) ::ffff:10.0.0.3/96
(iv) CE.6B.7A.12/20
¥ It has been said that when 1Pv6 tunnels through IPv4 routers,
IPv6 treats | 2 Cot | L4
the IPv4 tunnels as link-layer protocols. Do you agree with
this -
statement? Why or why not?
What is the principle of operation of SDN?
@

2 | CO2
9 Suppose the following sequence of bits arrives over
a link: 2 | CO6 | L3
! 1101011111010111410 010111110110
Show the resulting frame after any stuffed bits h
have been removed.
Indicate any errors that might have been introduced
into the frame. :
10 Suppose that N switches supporting K VLAN groups
are to be connected | 2 | CO6 | L2
via a trunking protocol. How many ports are
needed to connect the
switches? Justify your answer.
 PART- B (5 x 13 = 65 Marks)
(Restrict to a maximum of 2 subdivisions)

Q. No Questions | Marks BL
11 (a) (i) | SMTP is a request-response protocol. Show the minimal set of request- 8
response messages that should take place for a small message "hello" of
5 bytes to be sent from a client to a server. How many RTTs will it take ?
Can pipe-lining be employed to reduce the number of RTTs ? Explain.
(i) | Suppose a HTML file that you retrieve indexes 5 files from the same b
server, and 5 files from another server, how much time is taken (in terms
of RTT) to retrieve all information with (A) a non-persistent HTTP with no
parallel connections (B) a persistent HTTP without pipelining and (C) a
persistent HTTP with pipelining. Draw time-line diagrams to illustrate your
answer.
OR
11(b) (i) | Explain the working of DNS protocol to access a website 8

(o}
[}
vived.myorg.mydept.in.
(ii) | The rlogin is an application that provides a remole-echoed virtual terminal | 5

(o}
o}
facility (Every character sent is echoed back to the terminal). It uses TCP.
If a command “cat main.txt" is typed on the terminal, how many RTTs wil
elapse before the contents are displayed on the terminal ? Give reasons
for your answer.

12 (a) (i) | Assume that a TCP connection is in the ESTABLISHED state. Draw the 8
state transition diagram for closing the TCP connectlion, and explain the
possible sequences of operation with a timeline diagram.
(ii) | Consider the use of Nagle's algorithm. Suppose that the command “cat 5
net.txt” is sent by application, one character per second, over a TCP
connection with an RTT of 2.5 seconds. Draw a timeline indicating when
| each packet is sent and what it contains.
OR
used for retransmission timeout calculation in TCP | 8

& TCP (Reno) connection uses one 10Mbps link | 5

IN]
any data. Suppose that this link is the only O
ding and receiving hosts. Assume that |
file to send to the receiver, and the receiver's
than the congestion window. We also make
sumptions: each TCP segment size is 1,500 bytes; the
propagation delay of this connsction is 150 msec; and this TCP
on is always in congestion avoidance phase, that is, ignore slow

dow size (in segments) that this TCP

on can achieve?
is if ge window size (in segments) and average
is TCP connection?
for this TCP connection to reach its maximum
ng from 2 packet loss?

hing. Consider the VC | 8

1 F the VC table entries to
connections for two flows from A to
m
 1 3 1.3 1.3 1.2 Figure 13(a)
(ii) | Suppose a router has built up the routing table shown in the following COo5 | L3
Table. The router can deliver packets directly over interfaces 0 and 1, or
it can fgrward packets to routers R2, R3, or R4. Describe what the router
does with a packet addressed to each of the destinations
(a) 128.96.39.10, (b) 128.96.40.12, (c) 128.96.40.151, (d) 192.4.153.17,
(e) 192.4.153.90.

SubnethNumber | SubnetMask | NextHop

128.96.39.0 Inz: 0

128.96.39.128 lntesface 1
128.96.40.0 R2
192.4.153.0 R3
{default) R4

OR
13 (b) (i) [ Using link state protocol show how the routing table would be constructed €04 | L3
at node C in the Figure 13(b) below.

Figure 13(b)
(ii) | What is the maximum bandwidth at which an IP host can send 576-byte CO5 | L3
packets without having the Ident field wrap around within 80 seconds?
Suppose IP's maximum segment lifetime (MSL) is 60 seconds, that is,
delayed packets can arrive up to 60 seconds late but no later. What
might happen if this bandwidth were exceeded?

14 (a) (i) | Consider three LANs interconnected by two routers, as shown in Figure CO5 | L3
14 below.
A. Assign IP addresses to all of the interfaces. For Subnet 1 use
addresses of the form 192.168.1.xxx; for Subnet 2 uses addresses of the
form 192.168.2.xxx; and for Subne! 3 use addresses of the form
192.168.3.xxx.
B. Assign MAC addresses to all of the adapters.
C. Consider sending an IP datagram from Host E to Host B. Suppose all
of the ARP tables are up to date. Enumerate all the steps.
D. Repeat (c), now assuming that the ARP table in the sending host is
empty (and the other tables are up to date).

Subnet 1 Subnet3

Subnet 2
Figure 14
(ii) | Explain the integration of e-BGP and i-BGP, assuming that the subnets 1
 and 3T el o AR i subpet & Boluiygps b AR
) oR
oo ]
TG 3 DRI e working of DECE protoea
i W i ?‘1:;\',\05« Annt Uliivensaty e snnll 13 hat has pakd o oget I.,“Al‘ et O SRR i
F Lo oonnect to e rest of e intemet, 1akae D paid anethor 1E Ratliet
i 10 0d s 2 DACKUD COMMeeion 1 provido connecivity (e TRENI Nl
i f ails. What are the typos of the fhiee 180 1A Univorsily leams of o
i { hath 10 some prebiy from BENE, should @ advortise he path o Railnet?
{ Why o why pot? [CHR A N ERAR KA
o
)-

TR RG] ! WY e encoding sehemoes teedod Show how e data Lo oo ot n|oon

| will e envoded tsing e sehemes - ARRK TFRR, QEBI NI and
coding.
i s A and B are ona 10 Mbps Ehomet segment, and (e b cod
{ propagation dolay between the two nudes fs S00 bit tnes, Suppoze tode
1 A begins transmiting a frame, and botore (L tinishes, node B beging
|1
| n T Why or Why not ?
L
OR
slon Avoidance moechanism usod I ECE 80 o | con
Why s it needed? Can you suggoest any othor altemative’
iven a CRC polynomial of x4+, ealeulato the CRE that s tansmitted 4| coa
_J {qr a data pattern of 101011011 an error vcetrs inthe mos sloniticant
ata, show how it will be detected,

PART-C (1 x 15 = 15 Marks)
(Q.No 16 is compulsory)

Q. No Questions ’ ) T marks | €O BL
16. (i) Consider transfer of packets for Voice-ovor-IP applications. G COd
One of the drawbacks of a small packel size that o largo +
fraction of link bandwidth is consumed by overhead byles. To 9
understand this, suppose that the packet consists of L bytes and
5 bytes of header.
a. Consider sending a digitally encoded voice source directly,
Suppose the voice is encoded at a constant rate of 128 Kbps.
Assume each packel is entirely filled before the source sonds the
packet into the network. The lime roquired to fill a packot is tho
packetization delay. In terms of L, determine the packelization
delay in milliseconds.
b. Packetization delays grealer than 20 msec can cause a
noticeable and unpleasant echo. Determina the packetization
delay for L = 1,500 byles (roughly corresponding to a maximum-
sized Ethernet packet) and for L = 50 (corresponding lo an ATM
packet).
¢. Calculate the store-and-forward delay at a single switch for a
link rate of R = 622 Mbps for L = 1,500 byles, and for L. = 50
bytes.
d. Comment on the advantages of using a small packel s S
N
Y
3 Q
o o
(i)You are to design a new network application that has to run on
a satellile designed to caplure images of the moon and sond il lo )
®
earth. Give delails of your design including messago formals,
sequence of messages exchanged, relransmission slrategies,
and any other imporlant details that you can think of.
 e, | | [ [
ANNA UNIVERSITY (UNIVERSITY DEPARTMENTS)
][] ]]
B.E./B. Tech /B. Arch (Full Time) — Assessment-2, AUGUST-DECEMBER 2022

INFORMATION TECHNOLOGY
Semester-5
IT5551 & Computer Networks
(Reguilation 2019)
Time: 3hrs Max.Marks: 100

CO1 To understand the concept of layering in networks.

CO2 | Toknow the functions of protocols of each layer of TCP/IP prot
CO 3 | To visualize the end-to-end flow of information
CO4__| To understand the components required | d
CO5 | To learn concepts related to network ad
BL - Bloom’s Taxonomy Levels
(L1 - Remembering, L2 - Understanding, L3 - Applying, L4 - Analysing, L5 - Evaluating, L6 - Creating)

PART- A (5 x 2 =10 Marks)

(Answer all Questions)

Q. No Questions | Marks [ CO | BL
1 Change the following IPv4 addresses
from dotted-decimal 2 co2
notation to binary notation.
a. 111.56.45.78
b. 221.34.7.82 o o ] |
2 Define fragmentation and explain why the [Pv4 and IPv6 protocols 2 Cco4
need to fragment some packets. Is there any difference between
the two protocols in this matter?
3 What is meant by the term "route aggregation"? Why is it useful 2 CO5
for a router to perform route aggregation?
4 What is the message complexity of LS routing algorithm? 2 CO5
5 Why do OSPF messages propagate faster than RIP messages? 2 Co3

. PART- B (2 x 13 = 26 Marks)
(Restrict to a maximum of 2 subdivisions)

[ @ No Questions Marks | CO BL
6 (a) (i) | Consider a subnet with prefix 192.168.56.128/26. Give an 8 CcOo3
example of one IP address ( of form xxx.xxx.xxx.xxx) that can be
assigned to this network. Suppose an ISP owns the block of
addresses of the form 192.168.56.32/26. Suppose it wants to
create four subnets from this block, with each block having the
same number of IP addresses. What are the prefixes ( of form
a.b.c.d/x) for the four subnets?
(if) | What is the problem of NAT in P2P applications? How can it be 5 Cco4
avoided? Is there a special name for this solution?
OR
; 6 (b) (i) | An organization is granted the block 16.0.0.0/8. The administrator 8 Cco4
i wants to create
500 fixed-length subnets.
i a. Find the subnet mask.
b. Find the numberof addresses in each subnet.
 c. Find the first and |ast add
resses in subnet 1,
1.d. Find the first and Jast addressesin sub {
N3 How can we distinguish a
mul
net 500
ticast address in IPv4 ‘
addressing?
|.How can we do $0.in IPvB addres
7@

&
sing?
Consider a general topology and
a synchronous version of the
distance-vector algorithm. Suppos
e that at each iteration, a node

@
exchanges its distance vectors with
its neighbors and receives
their distance vectors. Assuming that
the algorithm begins with
each node knowing only the costs
to its immediate neighbors,
what is the maximum number of ite
rations required bhefore the

SRS
distributed algorithm converges? Just
ify your answer.
(i) Can the poisoned reverse solve the
general counf—ié-infinily
problem? Justify your answer. 5

(S
OR
7(d) () Explain the following in the context of link state routing
protocol. i. | 8

{0
Hello packets ii. Link state packet construction iii.Flooding iv.
Graph database construction.

S P
(i) Will & BGP router always chooss the loop-free route with the |
5
shortest ASpath length? Justify your
answer.

PART- C (1 x 14 = 14 Marks)
(Q.No.8 is compulsory)

| QNo | Questions Marks *éo E’Zi"

| 8. [ Consider the following network. With the indicated link costs, use
14 R
Dijkstra's shortest-path algorithm to compute the shortest path
from x to’ all network nodes

en compute the following

i) Co[r)npute the shortest path from t to all network nodes.
"o ooTw

Compute the shortest path from u to all network nodes.

Compute the shortest path from v to all network nodes.
Compute the shortest path from w to all network nodes.
Compute the shortest path from y to all network nodes.
Compute the shortest path from z to allinetwork nodes.
 Roll e,

ANNA UNIVERSITY (UNIVERSITY

Departmient of lnlmm.nu,n Teo

115551 Computer Hmwwm

Assessment 1
(Requbation 761%)
Time 1.5 his
Date: 6" October, 2022

cO1 . I To understand the concept of la/wing in networ

CO2 | To visualize the end-to-end flow of inform
C _| To understand the componenu requi
CO4__ | Tolearn concepts related to rk
CO5 | Tounderstand the major
BL - Bloom’s Taxonomy Levels
(L1 - Remembering, L2 - Understanding, L3 - Applying. L4 - Anzlyzing,

PART- A (5 x 2 =10 Marks)

(Answer all Quesfions)
Q 'Nof‘ Questions
Which of the OS [zlayers handle each of the following?
a) Dividing the transmitted bit stream into frames
___b) Determining which route through th s
2 State true or false: Telnet is 2 hign-overnesd protocol. Justs Ty ¥

v
[N]
| |answer _ o
3 What DNS cache issues will be involved in changing the P zcd N}

[N
| ofaweb server name?
4 What is meant by a handshaking p Give example p)
5 Compare and contrast connecfionle: s and connegticn-of i
| _| transport layer services.

PART-B(2 x 13
= 26 Marks
(Restrict to a maximurn of 2 subdivisions)

Q. No Questions Marks C
(11}
[s]

6(3) (i) | Suppose Alice, with a Web-based e-mail account (such as Hotrmzi
ra
0

Gmail), sends a message to Bob, who accesses his mail from hi: |
server using POP3. Discuss how the message gets from Alice's host
to Bob's host. Be sure to list and explain the series of application-izyer 1
_protocols that are used to move the message between the two hosis. :
(i) | What does a stateless protocol mean? Is IMAP stateless? What sbout . 5 2 3
| lsmrP? | ‘
e ) - ___OR
6 (b) (i) | Suppose Host A wants to send a large file to Host B. The path from |
Host A to Host B has three links, of rates R1=500 kbps, R2=2 Mbps, {
and R3=1 Mbps. i
a. Assuming no other traffic in the network, what is the throughput for i
the file transfer? |
b. Suppose the file is 4 million bytes. Dividing the file size by the
throughput roughlyhow long will it taPe to transfer the file to Host B7
 7() @)
B an enormous file over this connection. Host A can send its
application data into its TCP socket at a rate as high as 120 Mbps
but
Host B can read out of its TCP receive buffer at a maximum
rate of 50
Mbps. Describe the effect of TCP
- flow control.
) (ii)(Shcw the TCP connection establishment and termination with | & 5|5
sequence diagram
OR
7 (b) (i) | Suppose that a Web server runs in Host Con port 80. Suppose this 8 3
Web server uses persistent connections, and is currently receiving
requests from two different Hosts, A and B. Are all of the requests
being sent through the same socket at Host C? If they are being
passed through different sockets, do both of the sockets have
port 80?
. Discuss and explain
L (ii) | Discuss two army problem that has an impact in designing the three-
5 4 (]
. way handshake protocol followed in transport layer

PART- C (1 x 14 = 14 Marks)
(Q.No.8 is compulsory)
[[QNo ] Questions Marks | CO BL
8.) | Host A and B are communicating over a TCP connection, and
Host B has already received from A all bytes up through byte 126.
Suppose Host A then sends two segments to Host B back-
to-back. The first and second segments contain 80 and 40 bytes
of data, respectively. In the first segment, the sequence number 10 4 3
S D is 127, the source port number is 202, and the destination poit - o
number is‘80. Host B sends an acknowiedgment whenever it
receives a segment from Host A.
a. In the second segment sent from Host A to B, what are the
sequence number, source port number, and destination port
number? 3
b. If the first segment arrives before the second segment, in the
acknowledgment of the first arriving segment, what is the
acknowledgment number, the source port number, and the
destination port number?
c. If the second segment arrives before the first segment, in the
acknowledgment of the first arriving segment, what is the
acknowledgment number?
d. Suppose the two segments sent by A arrive in order at B. The
first acknowledgment is lost and the second acknowledgment
arrives after the first timeout interval. Draw a timing
diagram, showing these segments and all other segments and
acknowledgments sent. (Assume there is no additional packet
loss.) For each segment in your figure, provide the sequence
number and the number of bytes of data; for each
acknowledgment that you add, provide the acknowledgment
number.

Describe why an application. developer might choose to run an

8 (i) application over UDP rather than TCP