Scribd
Upload
82 views1 page

Tut 2 PDF

The document contains a tutorial sheet with 4 questions related to computer networks and networking protocols. Question 1 asks about maximum achievable throughput using sliding window protocol with specific window sizes, packet sizes, and transmission times. Question 2 asks about the minimum number of bits needed for a sequence number field using selective repeat sliding window protocol. Question 3 asks about link utilization using stop and wait protocol with given bandwidth, round trip time, and packet size. Question 4 asks about total number of packets needed using stop and wait protocol when every 4th data packet is lost.

Uploaded by

Ayush kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
82 views1 page

Tut 2 PDF

The document contains a tutorial sheet with 4 questions related to computer networks and networking protocols. Question 1 asks about maximum achievable throughput using sliding window protocol with specific window sizes, packet sizes, and transmission times. Question 2 asks about the minimum number of bits needed for a sequence number field using selective repeat sliding window protocol. Question 3 asks about link utilization using stop and wait protocol with given bandwidth, round trip time, and packet size. Question 4 asks about total number of packets needed using stop and wait protocol when every 4th data packet is lost.

Uploaded by

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

DEPARTMENT OF INFORMATION TECHNOLOGY

NATIONAL INSTITUTE OF TECHNOLOGY, SRINAGAR


Tutorial sheet 2

Course: Computer Networks Course code: ITT350


Branch: Information Technology Semester: 6th

Q1) 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 us. What is the maximum achievable throughput in this
communication? (Ans: 11.11*10^6 Bps)

Q2) Consider a selective repeat sliding window protocol that uses a frame size of 1 KB
to send data on a 1.5 Mbps link with a one-way latency of 50 msec. To achieve a link
utilization of 60%, what is the minimum number of bits required to represent the
sequence number field? (Ans: 5 bits)

Q3) If the bandwidth of the line is 1.5 Mbps, round trip time (RTT) is 45 msec and
packet size is 1 KB, then find the link utilization in stop and wait protocol. (Ans: 10.8%)

Q4) Using stop and wait protocol, the sender wants to transmit 10 data packets to the
receiver. Out of these 10 data packets, every 4th data packet is lost. How many packets
sender will have to send in total? (Ans: 13)

You might also like