IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4614-5317-8_7.html
   My bibliography  Save this book chapter

Markovian Queueing Systems

In: Introduction to Queueing Systems with Telecommunication Applications

Author

Listed:
  • László Lakatos

    (Eötvös Loránd University)

  • László Szeidl

    (Óbuda University
    Széchenyi István University)

  • Miklós Telek

    (Budapest University of Technology and Economics)

Abstract

Queueing systems whose underlying stochastic process is a continuous-time Markov chain (CTMCs) are the simplest and most often used class of queueing systems. The analysis of these systems is based on the essential results available for the analysis of CTMCs. As a consequence, several interesting properties of these queueing systems can be described by simple closed-form analytical expressions both in transient (as a function of time and initial state) and in steady state.

Suggested Citation

  • László Lakatos & László Szeidl & Miklós Telek, 2013. "Markovian Queueing Systems," Springer Books, in: Introduction to Queueing Systems with Telecommunication Applications, edition 127, chapter 0, pages 199-224, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4614-5317-8_7
    DOI: 10.1007/978-1-4614-5317-8_7
    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.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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-4614-5317-8_7. 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.