Approximation Analysis of Open Acyclic Exponential Queueing Networks with Blocking

Hyo-Seong Lee and Stephen M. Pollock
Additional contact information
Hyo-Seong Lee: Kyung Hee University, Seoul, Korea
Stephen M. Pollock: University of Michigan, Ann Arbor, Michigan

Operations Research, 1990, vol. 38, issue 6, 1123-1134

Abstract: An arbitrary configuration of an open queueing network with exponential service times and finite buffers is analyzed. We offer an iterative procedure for approximating the marginal occupancy probabilities for each queue of the system. The method decomposes the queueing network into individual queues and analyzes each in isolation using information from only its nearest neighbors. Based upon the SIMP approximation previously used for tandem queues, it replaces each server's service time with a clearance time, which includes blocking, and each server's arrival rate by an equivalent acceptance rate. The procedure is easy to implement and requires modest memory and computer time. Extensive numerical experiments, performed for various topologies, yield accurate results compared with those obtained by exact or simulation methods.

Keywords: queues; applications: analysis of networks with blocking; queues; limit theorems: approximation method for networks with blocking (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.6.1123 (application/pdf)

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:inm:oropre:v:38:y:1990:i:6:p:1123-1134

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().