The Problem
Consider an errorfree 64kbps satellite channel used to send 512byte data frames in one direction, with very short acknowledgements coming back the other way. What is the maximum throughput for window sizes of 1, 7, 15 and 127? We assume that the earthsatellite propagation time is 270 msec.


What we know:

the bandwidth: b=64kbits/second

the frame length: l=512 bytes=4096 bits

the propagation time: t_{prop}=270msec
We can also compute the time required to transmit one frame on the channel:

the transmission time: _{ }msec.

Let us consider a window size of N and see that happens:
t=0t=t_{trans}t=N* t_{trans}t=t_{prop}t= t_{trans} +t_{prop}t= t_{trans} +2*t_{prop}After this, all the frames are acknowledged one after the other, and the process restarts. So, one can see that the on the line there are always N or N1 frames in transit. The sender sends N frames during the time interval t= t_{trans} +2*t_{prop}. Thus the throughput is:
_{ }
However, there is a condition to be met in order for things to work the way they have been described: when the sender receives the first acknowledge, it should have send its entire window, that is,
_{ },
or equivalently:
_{ }
Hence, the general formula for the throughput is given by:
_{ }

In our case, the condition becomes: _{ }9, that is, the top throughput is reached for N=9.
Hence, the numeric solution for our problem is:
NThroughputEfficiency16798 bits/second10.37%747586 bits/second72.61%1564 kbits/second100%12764 kbits/second100%
Conclusion
We can conclude that when using a sliding window protocol on an errorfree channel, the throughput grows linearly with the size of the window until the bandwidth of the transmission line is reached. 