3,297 views
1 1 vote

Why can't I get answer by using formulae

Window size = 1+2a.....

Station A uses 32 byte packets to transmit messa

ges to station B using sliding window protocol. The round trip delay between A and B is 40 milliseconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is ______

  1. 20
  2. 10
  3. 30
  4. 40

1 Answer

1 1 vote

Bottleneck  bandwidth = 64 kbps=64x103 bps

Round trip delay = 40 ms =40x10-3 sec

Total data 40x64x103 x10-3 =  bits  = 40x64 /8  bytes =320 bytes.

1 packet size = 32 byte

No. of packets 320/32  = 10

Hence (2 ) is the ans

Position:
Show:

Related questions

0 0 votes
0 0 answers
721
721 views
Dknights asked Oct 5, 2024
721 views
Please explain the below question6. Station A sends data to station B over a full duplex link. Both A and B are using the sliding window protocol for flow control. The wi...
1 1 vote
3 3 answers
915
915 views
chetankamani asked Jul 15, 2024
915 views
Consider the sliding window algorithm where sender window size is 9 and receiver window size is 7 and no out of order arrivals. What is the smallest value for maximum seq...
0 0 votes
2 2 answers
2.2k
2.2k views
fred20978 asked Nov 8, 2022
2,221 views
I understood that receiver will correctly discard the frames in GBN all ack lost case. But its given that its positive ack and hence receiver wont send ack for discarded ...
2 2 votes
1 1 answer
3.2k
3.2k views
Ram Swaroop asked Jan 22, 2019
3,232 views
Consider two computers A and B areconnected through a network of 30 Mbps. Assume the distance between them is 3000km and the signal propagation speed is same as the speed...