Name: …………………….

… Scholar No: …………………………

Maulana Azad National Institute of Technology, Bhopal-462003
Department of Computer Science and Engineering
B.Tech, VI Semester Computer Networks (CSE-321)
Supplementary Examination, June 2020
Note: (i) Attempt all questions Max Marks: 30 Time: 2hrs.
(ii) Take suitable assumptions wherever necessary and clearly state the same.
Q. No. Question M

Q1 a) Write a short note on Selective Repeat protocol. In SR [Window size = 4] Protocol if 6

every 3rd packet that is being transmitted is lost and if we have to send 14 packets,
then how many transmissions are required?

b) Derive efficiency for infinite population Pure Aloha and finite population Slotted
Aloha protocol.

c) Write the link utilization formula for the stop-and-wait protocol in terms of Tt (frame
transmission time) and Tp (propagation time) with error and without error. Briefly
define these parameters.

Q2 a) Compute approximate optimal window size when packet size is 53 bytes, the RTT is 6
60ms and bottleneck bandwidth is 155 Mbps.

b) Given an error free 64kbps satellite link channel which is used to send 512 byte data
frame in one direction with very short acknowledgements coming back the other
way. What will be the maximum throughput for window size 7 and 127?

c) A channel has a bit rate of 4 kbps and propagation delay of 22 msec. For what range
of frame size does stop and wait protocol give an efficiency of at least 60%?

a) Suppose that you had to design a 106 bps CSMA/CD protocol in which the maximum
Q3 6
one-way propagation delay between any two hosts is 100 x 106 sec. What will you
use as the minimum size of a transmitted frame if you wish the transmitting node to
detect a collision before completing the transmission of the frame?

b) Host A is sending data to host B over a full duplex link. A and B are using the sliding
window protocol for flow control. The send and receive window sizes are 5 packets
each. Data packets (sent only from A to B) are all 1000 bytes long and the
transmission time for such a packet is 50 μs. Acknowledgment packets (sent only
from B to A), are very small and require negligible transmission time. The
propagation delay over the link is 200 μs. What is the maximum achievable
throughput in this communication?

c) Why would the token passing protocol be inefficient if a LAN had a very large
perimeter? Explain the concept of token ring protocol IEEE 802.5.

Q4 a) In a data link connection where CRC (Cyclic Redundancy Check) is used, an 8-bit 6
Page 1 of 2
 information is given as 1 1 0 1 0 0 1 0. The generating function used in the CRC is
G(x) = x3+ x + 1. Calculate the CRC code.

b) Describe the working of the CSMA/CD protocol with binary exponential back-off
mechanism.

c) Hosts A and B are connected to each other via router R. R is a store-and-forward

router. The bandwidth from A to R is 10Mbps, and the bandwidth from R to B is
5Mbps. The one-way latency of each link is 22ms. Assume host A sends a 30KB file
to host B. Now, assume each packet is acknowledged. The file is divided into 6
packets of the same size. How long would it take to send the entire file assuming that
the sender cannot send a new packet before it receives an acknowledgment for the
previous packet? (The transfer time is the time interval measure at source A from the
time the first segment is sent until the acknowledgement of the last segment is
received). Ignore the transmission time of the acknowledgements.

a) For the network address: 192.168.10.0 and subnet mask: 255.255.255.248, find the
Q5 6
number of subnets and hosts?

b) Explain the working of Open shortest path first (OSPF) routing algorithm with a
proper example and diagram.

c) Explain the frame format of IEEE 802.5 in detail. How is it different from IEEE
802.3 in terms of channel access mechanism, limitation of frame size etc. ?

Page 2 of 2