type i, , K , 1 i = who finds the server free begins to get service inmediately and leaves the system after completion. Otherwise, if the server is busy, the customer with probability 1 Hi leaves the system without service and with probability Hi > 0 joins an orbit of repeated customer but conserves its own type. The intervals separating two succesive repeated attempts of each customers from the orbit are exponentially distributed with rate γ. The orbit is finite or infinite. In case of a finite orbit an arriving customer who finds the server busy and the orbit completely full is lost. We derive the steady state probabilities of the multidimensional Markov process underlying the considered queueing system.
分享
引用
