Markovian Queueing Systems

László Lakatos, László Szeidl and Miklós Telek
Additional contact information
László Lakatos: Eotvos Lorant University
László Szeidl: Obuda University
Miklós Telek: Technical University of Budapest

Chapter Chapter 7 in Introduction to Queueing Systems with Telecommunication Applications, 2019, pp 299-334 from Springer

Abstract: 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.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-15142-3_7

Ordering information: This item can be ordered from
http://www.springer.com/9783030151423

DOI: 10.1007/978-3-030-15142-3_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().