Buffer Behavior for Binomial Input and Constant Service

An analysis of the discrete-time queuing problem: binomial input, constant message length, infinite queue length, one server, is carried out. The state probabilities are calculated using the method of imbedded Markov chains, and the results are applied to the problem of determining characteristic features in the performance of a traffic concentrator. The results are compared to the direct numerical solution of the equations of state for a finite buffer queue concentrator.