IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4614-6765-6_10.html
   My bibliography  Save this book chapter

Closed Networks of Exponential Queues

In: Queues

Author

Listed:
  • Moshe Haviv

    (The Hebrew University)

Abstract

Suppose M single-server service stations are located in a network. Service times in station i follow an exponential distribution with parameter μ i , 1 ≤ i ≤ M. There are N customers (or jobs) who are “trapped” in the network and move from one station to another as soon as service ends at the former station. These dynamics are governed by a transition (stochastic) matrix P. Specifically, once a job ends its service in station i, it hops to the queue in front of server j with probability P ij . Of course, P ij ≥ 0, 1 ≤ i, j≤ M, and $$\Sigma _{j=1}^{M}P_{ij} = 1$$ . There is no need to assume that P ii = 0, 1 ≤ i ≤ M. However, we assume that P (or more precisely, a Markov chain whose transition probabilities are given in P) is irreducible.

Suggested Citation

  • Moshe Haviv, 2013. "Closed Networks of Exponential Queues," International Series in Operations Research & Management Science, in: Queues, edition 127, chapter 0, pages 151-163, Springer.
  • Handle: RePEc:spr:isochp:978-1-4614-6765-6_10
    DOI: 10.1007/978-1-4614-6765-6_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:isochp:978-1-4614-6765-6_10. 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.