00:01
Hello students, there is a sliding window protocol that has a 4 -bit sequence repeat feature.
00:07
4 -bit repeat feature.
00:09
So what is optimal window size? so to determine the optimal window size, the number of timers required on the sender side and the number of receiver buffers required for the sliding window protocol with a selective 4 -bit sequence, we need to consider the characteristics.
00:30
So first part optimal window size is the maximum number of outstanding packets that can be sent or that can that the sender can have in the network without receiving acknowledgement.
00:44
So this is the optimal window size.
00:46
It is essential to balance the efficiency of utilizing available bandwidth and the likelihood of encountering errors or conjunction.
00:55
So optimal window size will be equal to 2 raised to n minus 1 where n is the number of bits.
01:05
So here this is the equation optimal window size will be equal to 2 raised to n minus 1.
01:13
So n is the number of bits here.
01:14
So that is 2 raised to 4 minus 1.
01:19
So that is equal to 16 minus 1 that is 15.
01:22
So that is the optimal window size here.
01:26
Okay first part.
01:27
Now coming to b part, the optimal number of time timers on the sender side.
01:35
So the optimal numbers for for selective repeat the sender needs to maintain a separate timer for each packet that has been sent but not acknowledged.
01:47
When the timer expires, the sender retransmits.
01:52
Right.
01:52
So this is the packet received.
01:54
So when the timer expires, it retransmits the information about the the specific packet.
02:03
So it goes to goes back number of timers required on the sender side is equal to the window size because each packet in the window has a timer...