Analysis of G–queue with unreliable server

Abstract

This paper presents a model for a discrete time single server G-queue with two types of independent arrivals, namely positive and negative. The arrival of negative customer to queueing system removes one customer from the head of the queue (RCH), which causes server breakdown. The repair of the server is non-instantaneous and after repair server is assumed as good as new. The interarrival times of both positive and negative customers and the repair times of the server are geometrically distributed. We analyse the queueing system by using Matrix Geometric method. The expressions for various performance measures such as mean queue length, throughput, delay, etc. are derived and calculated numerically.