A Single-Channel Poisson–Erlang System with a Limited Number of Waiting Positions and Relative Priority

P. P. Bocharov


Abstract: We shall analyze a single-channel queueing system receiving two elementary flows of demands where the demands on one channel have a relative priority over the others. The demands of various kinds have an Erlang distribution of servicing time. We shall consider the case of a general queue with a limited number of waiting positions. A numerical example is given.

UDC: 519.152

Received: 25.10.1968
Revised: 17.02.1969

 English version: Problems of Information Transmission, 1969, 5:4, 41–48

Bibliographic databases:

•