Decomposition Approach

Svenja Lagershausen
Additional contact information
Svenja Lagershausen: University of Cologne

Chapter Chapter 4 in Performance Analysis of Closed Queueing Networks, 2013, pp 45-60 from Springer

Abstract: Abstract In the following, we present an iterative algorithm that is based on decomposition. It approximates the throughput of a closed queueing system with linear flow, general processing times, and finite buffer spaces. The service times at each station are assumed to be i. i. d. random variables with a general distribution that is described by the mean and the coefficient of variation. The stations consist of single servers with a first-come first-served queueing discipline.

Keywords: Arrival Rate; Arrival Process; Outer Loop; Decomposition Approach; Linear Flow (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_4

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

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

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 ().