A queueing model for error control of partial buffer sharing in ATM (Q1970057)

Two Poisson processes of different priorities arrive at a single server with finite waiting room. High priority customers enter the system whenever there is space in the waiting room. Low priority customers only enter if the queue length is below a fixed prescribed queue length which is less than the maximal buffer content. Customers not allowed to enter are lost. Customers being served are fed back to the server immediately according to the decision of a Bernoulli switch. The model originates from cell admission control schemes under ATM. The authors derive steady state measures for the quality of service, e.g. loss probabilities, waiting times (approximations), effective arrival rates.