A Markovian Working Vacation Queue with Server State Dependent Arrival Rate and with Unreliable Server | Zendy

R. Kalyanaraman | Zendy; A. Sundaramoorthy | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Markovian Working Vacation Queue with Server State Dependent Arrival Rate and with Unreliable Server

Author(s) -

R. Kalyanaraman,

A. Sundaramoorthy

Publication year - 2018

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/ijca2018916926

Subject(s) - computer science , queue , state (computer science) , markov process , markovian arrival process , real time computing , computer network , algorithm , statistics , mathematics

A single server Markovian queueing system with the system alternates between regular busy state, repair state and working vacation state has been considered. The system is busy, it functions as a single server Markovian queue. When it is on vacation, again it functions as a single server Markovian queue but with different arrival and service rates. The vacation policy is multiple vacation policy and the vacation period follows negative exponential. In addition, during service the server may break down, the repair of the server starts immediately. The repair period follows negative exponential. The steady state probability vector of number of customers in the queue and the stability condition are obtained using MatrixGeometric method. Some illustrative examples are also provided.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research