Markovian queueing system with discouraged arrivals and self-regulatory servers (Q1748482)

Summary: We consider discouraged arrival of Markovian queueing systems whose service speed is regulated according to the number of customers in the system. We will reduce the congestion in two ways. First we attempt to reduce the congestion by discouraging the arrivals of customers from joining the queue. Secondly we reduce the congestion by introducing the concept of service switches. First we consider a model in which multiple servers have three service rates \(\mu_1\), \(\mu_2\), and \(\mu\) (\(\mu_1 \leq \mu_2 < \mu\)), say, slow, medium, and fast rates, respectively. If the number of customers in the system exceeds a particular point \(K_1\) or \(K_2\), the server switches to the medium or fast rate, respectively. For this adaptive queueing system the steady state probabilities are derived and some performance measures such as expected number in the system/queue and expected waiting time in the system/queue are obtained. Multiple server discouraged arrival model having one service switch and single server discouraged arrival model having one and two service switches are obtained as special cases. A Matlab program of the model is presented and numerical illustrations are given.