A maximum entropy approach for the N policy M/G/۱ 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/۱ 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.

کلیدواژه ها:

maximum entropy ، M/G/۱ queueing system ، N policy ، removable server