Performance evaluation of open queueing networks with arbitrary configuration and finite buffers

H.S. Lee, A. Bouhchouch, Y. Dallery and Y. Frein

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

Abstract: We consider an open queueing network consisting of servers linked in an arbitrary configuration with exponential service times and separated by intermediate finite buffers. The model allows any number of saturated servers (never starved) and exit servers (never blocked). The considered blocking mechanism is blocking-after-service. In the case of simultaneous blocking, blocked customers enter the destination node on a first-blocked-first-enter basis. If feedback loops exist in the network, deadlocks may arise. We assume that a deadlock is detected and resolved instantaneously by transferring all the blocked customers simultaneously. In this paper, we present an approximation method to analyze this kind of networks. The method decomposes the original network into subsystems. Each subsystem is composed of one or many upstream servers and one downstream server, separated by a finite buffer. The upstream and downstream servers are characterized by exponential service time distributions. Based on the symmetrical approach [2], we develop an algorithm to determine the unknown parameters corresponding to each subsystem. The class of models considered in this paper includes the class of open loss models for feed-forward networks considered by Lee and Pollock [11]. For this class of models, we can show that the system of equations in our algorithm is equivalent to the one used in the algorithm proposed by Lee and Pollock. As a result, our algorithm provides the same results as the algorithm of Lee and Pollock for this class of models. However, it is observed that our algorithm takes less CPU execution time than the one proposed by Lee and Pollock. For the cases of networks with feedback loops, extensive numerical experiments show that the new algorithm, in general, converges very fast and yields accurate results compared with those obtained by simulation as long as deadlocks do not occur too frequently. Moreover, for the merge configuration, we provide the proof of the convergence of the algorithm as well as the existence and uniqueness of the solution by exploiting the properties associated with a symmetric approach. Copyright Kluwer Academic Publishers 1998

Keywords: queueing networks with finite buffers; blocking; performance analysis; decomposition techniques (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018918604554 (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:181-206:10.1023/a:1018918604554

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

DOI: 10.1023/A:1018918604554

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