Maximum entropy analysis of the M[x]/M/1 queueing system with multiple vacations and server breakdowns

Maximum entropy analysis of the M[x]/M/1 queueing system with multiple vacations and server breakdowns

0.00 Avg rating0 Votes
Article ID: iaor20073137
Country: Netherlands
Volume: 52
Issue: 2
Start Page Number: 192
End Page Number: 202
Publication Date: Mar 2007
Journal: Computers & Industrial Engineering
Authors: , ,
Keywords: M/M/1 queues, vacation models, batch queues, entropy
Abstract:

We consider a single unreliable server in an M[x]/M/1 queueing system with multiple vacations. As soon as the system becomes empty, the server leaves the system for a vacation of exponential length. When he returns from the vacation, if there are customers waiting in the queue, he begins to serve the customers; otherwise, another vacation is taken. Breakdown times and repair times of the server are assumed to obey a negative exponential distribution. Arrival rate varies according to the server's status: vacation, busy, or breakdown. Using the maximum entropy principle, we develop the approximate formulae for the probability distributions of the number of customers in the system which is used to obtain various system performance measures. We perform a comparative analysis between the exact results and the maximum entropy results. We demonstrate, through the maximum entropy results, that the maximum entropy principle approach is accurate enough for practical purposes.

Reviews

Required fields are marked *. Your email address will not be published.