Abstract
This paper analyzes a single removable and unreliable server in the 〈 p , N 〉 -policy M/G/1 queue in which the server breaks down according to a Poisson process and the repair time obeys an arbitrary distribution. We assume that when the number of customers in the system becomes N, turn the server on with probability p and leave the server off with probability ( 1 - p ) . The use of maximum entropy approach is to develop the approximate formulae for the probability distributions of the number of customers and the expected waiting time in the system. We perform a comparative analysis between the derived approximate results with exact analytic results for three different service time and repair time distributions such as exponential, uniform, and gamma. It is shown from numerical results that the maximum entropy approach is sufficiently accurate for practical use.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
