Assume that frame transmission times ? are exponentially distributed with, for example, probability density p(?) = e- ? ,for ? >=0. Assume that a new frame always starts in each direction as soon as the previous one in that direction terminates. Assume that transmission times are all independent and that processing and propagation delays are negligibile. Show that the probability q that a given frame is not
asked before n-1 additional frames have been sent (i.e., the window is exhausted) is q = (1+n)2-n