A preemptive resume priority retrial queue with state dependent arrivals, unreliable server and negative customers (Q384517): Difference between revisions

An \(\mathrm{M}/\mathrm{G}/1\) queue serving two priority classes of customers which possesses complex additional features is considered. High priority customers (P1) have preemptive (resume) priority over low priority customers (P2). Service time distributions are type-dependent, arrival processes for the two classes are Poisson, modulated by the internal state of the system. There is an ordinary queue, which P1-customers always join, and a retrial queue, which P2-customers join if they find the server busy at their arrival instant. There are additional negative arrivals which delete P1 customers in service, if any, and vanish thereafter. The server is unreliable and breaks down after a random time and has to be repaired then, the repair time is random. Whenever the server becomes idle it takes a single vacation of random duration. Assuming standard independence assumptions and a supplementary variable technique, the author develops a Markov process description of the system and derives ergodicity conditions which are rather complex. Steady state analysis is performed using standard generating function methods. It is shown that the stationary state distribution decomposes into a sum of two independent components which have a direct interpretation. From the analytical results, performance and reliability measures are derived.