a maximum entropy approach for the n policy m/g/1 queueing system with a removable server

The maximum entropy principle has grown progressively more pertinent to queueing systems. the principle of maximum entropy presents an impartial framework as a promising method to examine complex queuing processes. in this research, the n policy m/g/1 queueing system with a removable server was analyzed by using the maximum entropy method. 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.