asafdav2
Newbie level 5
a communication line is given, with congestion control mechanism on it that includes fast retransmit.
[a] ----
we'll assume side a only sends packets of size A [bytes], and that side b only sends packets of size B [bytes]. the line bandwidth is C [bytes per sec], and the propagation time is d [seconds]. acks from side b are sent inside the B sized packets. we'll assume that the sending window size on side a is W [bytes]. what is the minimum timeout length in side a that will allow continuos packets sending, if we can guarantee that out of every n packets sent, at least n-1 will arrive correclty (and at most 1 will drop)?
i dont know how to interpret the last sentense. without it, the answer is that the total time to send a packet and get an ack for it is (2*d + (A+B) / C). but what happens if there's a packet drop ?
[a] ----
we'll assume side a only sends packets of size A [bytes], and that side b only sends packets of size B [bytes]. the line bandwidth is C [bytes per sec], and the propagation time is d [seconds]. acks from side b are sent inside the B sized packets. we'll assume that the sending window size on side a is W [bytes]. what is the minimum timeout length in side a that will allow continuos packets sending, if we can guarantee that out of every n packets sent, at least n-1 will arrive correclty (and at most 1 will drop)?
i dont know how to interpret the last sentense. without it, the answer is that the total time to send a packet and get an ack for it is (2*d + (A+B) / C). but what happens if there's a packet drop ?