IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4615-2241-6_19.html
   My bibliography  Save this book chapter

The Power-Series Algorithm for Markovian Queueing Networks

In: Computations with Markov Chains

Author

Listed:
  • W. B. van den Hout

    (Tilburg University, Faculty of Economics)

  • J. P. C. Blanc

    (Tilburg University, Faculty of Economics)

Abstract

A new version of the Power-Series Algorithm is developed to compute the steady-state distribution of a rich class of Markovian queueing networks. The arrival process is a Multi-queue Markovian Arrival Process, which is a multi-queue generalization of the BMAP. It includes Poisson, fork and round-robin arrivals. At each queue the service process is a Markovian Service Process, which includes sequences of phase-type distributions, set-up times and multi-server queues. The routing is Markovian. The resulting queueing network model is extremely general, which makes the Power-Series Algorithm a useful tool to study load-balancing, capacity-assignment and sequencing problems.

Suggested Citation

  • W. B. van den Hout & J. P. C. Blanc, 1995. "The Power-Series Algorithm for Markovian Queueing Networks," Springer Books, in: William J. Stewart (ed.), Computations with Markov Chains, chapter 19, pages 321-338, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4615-2241-6_19
    DOI: 10.1007/978-1-4615-2241-6_19
    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
    for a similarly titled item that would be available.

    Other versions of this item:

    More about this item

    Statistics

    Access and download statistics

    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:sprchp:978-1-4615-2241-6_19. 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.