recategorized
3,943 views
2 votes
2 votes

Station $A$ uses $32$ byte packets t transmit messages 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$
recategorized

10 Answers

0 votes
0 votes

If anyone is following the NPTEL course(Computer Networks and Internet Protocol), the course discusses the concept of BDP(Bandwidth Delay product) that can also be used to calculate the window size.
https://www.youtube.com/watch?time_continue=812&v=bKHRbqwkMkg&feature=emb_title

Given, RTT = 40ms, therefore one side time = 40/2 = 20ms 

BDP (Bandwidth Delay Product) = Link Bandwidth * Link Delay

Hence,

BDP = 64kbps * 20ms = 1280 bits

packet size = 32byte = 256 bits,

number_of_packets = 1280/256 = 5

WindowSize = 2*no_of_packets + 1 

w = 2*5 + 1 = 11 (we add +1 as the ACK is sent only when the first first segment is received)

Hence, (b) 10 is the correct option (closest option)

 

Answer:

Related questions

0 votes
0 votes
3 answers
1
2 votes
2 votes
4 answers
4
go_editor asked Feb 1, 2017
2,982 views
Let C be a binary linear code with minimum distance $2t+1$ then it can correct upto ___ bits of error$t+1$$t$$t-2$$t/2$