In a recent note1J. S. Hill attempts a criticism of the model for the Ek/D/1 buffer system which we have presented in [1]. His starting point is a discrepancy that he has observed between the results which have been published by Dor [2] for a buffer system with Poisson input and constant removal rate, and the results which J. S. Hill obtained when he applied our model [1, eq. (11)] for k = 1.

In this paper the principles which are involved in designing an equipment for producing sequences of pseudorandom pulses, non-Poisson-distributed, are discussed. Design criteria are given and applications are discussed.

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.

This paper is a case study of a general method for designing generators of repeatable non-Poisson sequences of pseudorandom pulses. A class of normal distributions and some classes of skew distributions are derived. Block diagrams and design guides are given. The study is based both on analytical and simulation approaches. Applications of the proposed system may be found in the field of hardware simulation techniques and in more efficient arrangements of general purpose machines where they are used in simulation studies.