Analysis of queueing networks with blocking using a new aggregation technique

Johann Christoph Strelen, Berthold Bärk, Jürgen Becker and Volker Jonas

Annals of Operations Research, 1998, vol. 79, issue 0, 142 pages

Abstract: Queueing networks with repetitive-service blocking are investigated. The state probabilities are calculated by applying a new aggregation technique, the disaggregation-aggregation (DA) iteration. Thus, one obtains close approximate solutions with product form. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018914503645 (text/html)
Access to full text is restricted to subscribers.

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:annopr:v:79:y:1998:i:0:p:121-142:10.1023/a:1018914503645

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018914503645

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().