Technical Note—On Normalizing Constants in Queueing Networks

P. G. Harrison
Additional contact information
P. G. Harrison: Imperial College of Science and Technology, London, England

Operations Research, 1985, vol. 33, issue 2, 464-468

Abstract: We present a method for deriving the normalizing constant for the state space probabilities in a closed Markovian queueing network with constant service rates. Our method produces a much simpler expression than any obtained previously. This expression takes the form of a sum of only M terms (if the visitation rate to service rate ratios are distinct), and is easily generalized to the degenerate case. The expression also yields a closed form solution for time delay distributions in cyclic networks of any length and with any number of customers.

Keywords: 689 cycle time distribution; 694 state space probabilities normalization (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.2.464 (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:33:y:1985:i:2:p:464-468

Access Statistics for this article

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