Arbitrary open queueing networks with server vacation periods and blocking

Charalabos Skianis and Demetres Kouvatsos

Annals of Operations Research, 1998, vol. 79, issue 0, 143-180

Abstract: A cost-effective decomposition algorithm is proposed for the approximate analysis of arbitrary first-come-first-served (FCFS) open queueing network models (QNMs) with Generalised Exponential (GE) external interarrival time and service time distributions, multiple vacation periods, exhaustive service scheme and repetitive service blocking of random destination (RS-RD). The algorithm is based on a new product-form approximation suggested by the information theoretic principle of Minimum Relative Entropy (MRE), subject to marginal mean value constraints and a prior joint distribution estimate of the corresponding open QNM with infinite capacity. The censored GEyGEy1yN queue with exponential server vacations is solved via relative entropy minimisation and in conjunction with associated effective flow streams (departure, splitting, merging), plays the role of an efficient building block in the solution process. An exhaustive validation study against simulation is included to illustrate the credibility of the MRE results. Copyright Kluwer Academic Publishers 1998

Keywords: Queueing Network Model (QNM); Minimum Relative Entropy (MRE) principle; Generalised Exponential (GE) distribution; server vacations; repetitive service blocking with random destination (RS-RD); flexible manufacturing systems; Asynchronous Transfer Mode (ATM) (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018966520483 (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:143-180:10.1023/a:1018966520483

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

DOI: 10.1023/A:1018966520483

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