Comparative analysis for the N policy M/G/1 queueing system with a removable and unreliable server |
| |
| Authors: | Kuo-Hsiung Wang Li-Ping Wang Jau-Chuan Ke Gang Chen |
| |
| Affiliation: | (1) Department of Applied Mathematics, National Chung-Hsing University, Taichung, 402, Taiwan;(2) Department of Statistics, National Taichung Institute of Technology, Taichung, 404, Taiwan;(3) Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA |
| |
| Abstract: | In this paper we analyze a single removable and unreliable server in the N policy M/G/1 queueing system in which the server breaks down according to a Poisson process and the repair time obeys an arbitrary distribution. The method of maximum entropy is used to develop the approximate steady-state probability distributions of the queue length in the M/G(G)/1 queueing system, where the second and the third symbols denote service time and repair time distributions, respectively. A study of the derived approximate results, compared to the exact results for the M/M(M)/1, M/E2(E3)/1, M/H2(H3)/1 and M/D(D)/1 queueing systems, suggest that the maximum entropy principle provides a useful method for solving complex queueing systems. Based on the simulation results, we demonstrate that the N policy M/G(G)/1 queueing model is sufficiently robust to the variations of service time and repair time distributions. |
| |
| Keywords: | Control Maximum entropy M/G(G)/1 queue Simulation Unreliable server |
| 本文献已被 SpringerLink 等数据库收录！ |
|
