Markov-Chain Approach

Svenja Lagershausen
Additional contact information
Svenja Lagershausen: University of Cologne

Chapter Chapter 5 in Performance Analysis of Closed Queueing Networks, 2013, pp 61-130 from Springer

Abstract: Abstract In this chapter, an analytical approach is presented for deriving the exact performance measures of closed queueing networks with finite buffer capacities, phase-type distributed processing times, and single servers. The closed queueing networks are represented by continuous-time Markov chains with discrete state space. We obtain the performance measures by setting up and solving a single Markov chain for the entire queueing system. Blocking is considered in blocking states that are subject to the phase-type distribution. The implementation allows an automated evaluation of an arbitrary number of configurations.

Keywords: Markov Chain; Transition Rate; Queue Length; Recurrence Time; Buffer Space (search for similar items in EconPapers)
Date: 2013
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:lnechp:978-3-642-32214-3_5

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

DOI: 10.1007/978-3-642-32214-3_5

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().