An Approximation Method for Open Restricted Queueing Networks

Yutaka Takahashi, Hideo Miyahara and Toshiharu Hasegawa
Additional contact information
Yutaka Takahashi: Kyoto University, Kyoto, Japan
Hideo Miyahara: Kyoto University, Kyoto, Japan
Toshiharu Hasegawa: Kyoto University, Kyoto, Japan

Operations Research, 1980, vol. 28, issue 3-part-i, 594-602

Abstract: This paper presents an approximation method for analyzing open restricted queueing networks with exponential service time and Poisson arrivals. Analysis is made by node-by-node decomposition through the introduction of a pseudo-arrival rate and an effective service rate. The method is applied to example networks and evaluated by comparing the results obtained thereby with those by simulations or exact calculations. We find that this method provides a fairly good approximation procedure for obtaining system performance measures such as blocking probabilities, output rates, etc., in open restricted queueing networks.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.3.594 (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:28:y:1980:i:3-part-i:p:594-602

Access Statistics for this article

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