analysis of a m[x]/g/1 queueing system with an unreliable server and delaying vacations using maximum entropy

This paper deals with a single unreliable server and with delaying vacations which has poisson arrivals and general distribution for the service times. the server can be activated at arrival epochs or deactivated at service completion epochs. the maximum entropy principle is increasingly relevant to queueing systems. the principle of maximum entropy (pme) presents an impartial framework as a promising method to examine complex queuing processes. we use maximum entropy principle to derive the approximate formulas for the steady-state probability distributions of the queue length. the maximum entropy approach is then used to give a comparative perusal between the system’s exact and estimated waiting times. we demonstrate that the maximum entropy approach is efficient enough for practical purpose and is a feasible method for approximating the solution of complex queueing systems.