Scribd
Upload
23 views

CN Assignment 2

Uploaded by

Ansh Balgotra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
23 views

CN Assignment 2

Uploaded by

Ansh Balgotra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Maharaja Agrasen Institute of Technology, Delhi

Department of Information Technology

Assignment Number : 2

Subject Name: Computer Networks


Subject Code: CIC-307
Class: 5IT
Note: Each question carries 5 Marks.
Q1) Consider a source computer (S) transmitting a file of size 106 bits to a destination computer
(D) over a network of two routers (R1 and R2) and three links (L1, L2 and L3). L1 connects S to
R1; L2 connects R1 to R2; and L3 connects R2 to D. Let each link be of length 100km. Assume
signals travel over each link at a speed of 10^8 meters per second. Assume that the link
bandwidth on each link is 1Mbps. Let the file be broken down into 1000 packets each of size
1000 bits.
Find the total sum of transmission and propagation delays in transmitting the file from S to D?

CO2

Q2) Consider an instance of TCP’s Additive Increase Multiplicative Decrease(AIMD) algorithm


where the window size at the start of the slow start phase is 2 MSS and the threshold at the start
of the first transmission is 8 MSS. Assume that a time out occurs during the fifth transmission.
Find the congestion window size at the end of the tenth transmission.
CO2

Q3) The maximum window size for data transmission using the selective reject protocol with n-
bit frame sequence numbers is:
CO2

Q4) In a network of LANs connected by bridges, packets are sent from one LAN to another
through intermediate bridges. Since more than one path may exist between two LANs, packets
may have to be routed through multiple bridges. Why is the spanning tree algorithm used for
bridge-routing?

CO2

Q 5) Station A uses 32 byte packets to transmit messages to Station B using a sliding window
protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth
on the path between A and B is 128 kbps. What is the optimal window size that A should use?

CO2

Q6) Station A needs to send a message consisting of 9 packets to Station B using a sliding
window (window size 3) and go-back-n error control strategy. All packets are ready and
immediately available for transmission. If every 5th packet that A transmits gets lost (but no acks
from B ever get lost), then what is the number of packets that A will transmit for sending the
message to B?

CO2
Q7) The distance between two stations M and N is L kilometers. All frames are K bits long. The
propagation delay per kilometer is t seconds. Let R bits/second be the channel capacity.
Assuming that processing delay is negligible, the minimum number of bits for the sequence
number field in a frame for maximum utilization, when the sliding window protocol is used, is:

CO2

Q8) Let the energy strength at point 2 is 1/50th with respect to the point 1. Find out the
attenuation in dB.

CO2

Q9) Assuming there is no noise in a medium of B = 4KHz, determine channel capacity for the
encoding level 4.

CO2

Q10) Why do you need encoding of data before sending over a medium?

Q11) Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming
signal is 46.4 ms. What is the minimum frame size?

CO2

Q12) The message 11001001 is to be transmitted using the CRC polynomial x^3 + 1 to protect it
from errors. What is the message that should be transmitted?

CO2

You might also like