论文信息 - Buffer Length for Erlang Input and Constant Removal Rate

Buffer Length for Erlang Input and Constant Removal Rate

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.

Dimitris G. Maritsas | M. G. Hartley | D. Maritsas

[1] Neville M. Dor. Guide to the Length of Buffer Storage Required for Random (Poisson) Input and Constant Output Rates , 1967, IEEE Trans. Electron. Comput..

[2] Samuel Karlin,et al. A First Course on Stochastic Processes , 1968 .

[3] D. Kendall. Some Problems in the Theory of Queues , 1951 .

[4] C. J. Ancker,et al. Some Queuing Problems with Balking and Reneging. I , 1963 .

[5] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .

[6] Dimitris G. Maritsas,et al. Design Criteria for a Generator of Repeatable Non-Poisson Sequences of Pseudorandom Pulses , 1970, IEEE Transactions on Computers.

[7] N. U. Prabhu,et al. Queues and Inventories , 1966 .