The problem of the length of a buffer store required for an Erlang input rate where words are removed at regular intervals is discussed. Analytical expressions relating buffer length to the loss resulting from overflow are derived. Graphical results are presented for a range of Erlang distributions.