Analysis of a Single Server Queueing System Controlled by a Random Switch

In this paper, a single server queueing system operating in doubly stochastic environment is analysed. The random makes transitions among N levels controlled by switch which performs the task of assigning job to server. resides level k till completion service last customer and immediately reports get new job. generates set up time waits arrives assigns any one with positive probability governed binomial distribution. each r environment, behaves like M(λr)/M(μr)/1 queue subject condition that after performing exhaustive for getting assignment. For model, time-dependent state probabilities are explicitly found corresponding steady-state deduced. Some key performance measures also obtained. A numerical study made.