IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v61y2005i3p505-520.html
   My bibliography  Save this article

Comparative analysis for the N policy M/G/1 queueing system with a removable and unreliable server

Author

Listed:
  • Kuo-Hsiung Wang
  • Li-Ping Wang
  • Jau-Chuan Ke
  • Gang Chen

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/E 2 (E 3 )/1, M/H 2 (H 3 )/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. Copyright Springer-Verlag 2005

Suggested Citation

  • Kuo-Hsiung Wang & Li-Ping Wang & Jau-Chuan Ke & Gang Chen, 2005. "Comparative analysis for the N policy M/G/1 queueing system with a removable and unreliable server," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 61(3), pages 505-520, July.
    • Handle: RePEc:spr:mathme:v:61:y:2005:i:3:p:505-520
    DOI: 10.1007/s001860400395
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860400395
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860400395?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:61:y:2005:i:3:p:505-520. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.