IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i7d10.1057_palgrave.jors.2601364.html
   My bibliography  Save this article

Analysis of M/M/S queues with 1-limited service

Author

Listed:
  • A Tyagi

    (Nortel Networks)

  • J Harms

    (University of Alberta)

  • A Kamal

    (Iowa State University)

Abstract

In this paper, a multiple server queue, in which each server takes a vacation after serving one customer is studied. The arrival process is Poisson, service times are exponentially distributed and the duration of a vacation follows a phase distribution of order 2. Servers returning from vacation immediately take another vacation if no customers are waiting. A matrix geometric method is used to find the steady state joint probability of number of customers in the system and busy servers, and the mean and the second moment of number of customers and mean waiting time for this model. This queuing model can be used for the analysis of different kinds of communication networks, such as multi-slotted networks, multiple token rings, multiple server polling systems and mobile communication systems.

Suggested Citation

  • A Tyagi & J Harms & A Kamal, 2002. "Analysis of M/M/S queues with 1-limited service," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(7), pages 752-767, July.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:7:d:10.1057_palgrave.jors.2601364
    DOI: 10.1057/palgrave.jors.2601364
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601364
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601364?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:pal:jorsoc:v:53:y:2002:i:7:d:10.1057_palgrave.jors.2601364. 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.palgrave-journals.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.