A model of buffer size and control policy for a queueing network with customers with different parameters

In this paper we analyse the yield of a queue management policy in a network which receives two classes of customers with different requirements and parameters, for the cost of delay and for balking. We prove how the state parameters can be obtained recursively and find the mean delays and loss rates for each class. From these we calculate the performance of the system, measured as a weighted sum of the delays to the customers and the losses.