Abstract Analytical results for priority queueing networks are extremely rare. Morris (1981) gave the exact solution for closed two node preemptive priority networks with negative exponential service time distributions which were independent of state. In this paper these results are extended to the case of state dependent service rates. Morris also gave an approximate solution to the system with non-preemptive priority at one node. The exact solution is presented and a comparison given between the exact and approximate solution. Also obtained are the exact solutions for two node systems with priorities reversed, state dependent service parameters and generalised service time distributions. Finally, a matrix geometric solution is obtained for two node systems with pre-emptive priority discipline at one node and any non-batch servicing queue discipline at the other.
[1]
P. Jacobs,et al.
Finite birth-and-death models in randomly changing environments
,
1984,
Advances in Applied Probability.
[2]
W. Henderson.
Insensitivity and reversed Markov processes
,
1983
.
[3]
R. Schassberger.
The insensitivity of stationary probabilities in networks of queues
,
1978,
Advances in Applied Probability.
[4]
Marcel F. Neuts,et al.
Matrix-geometric solutions in stochastic models - an algorithmic approach
,
1982
.
[5]
K. Mani Chandy,et al.
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
,
1975,
JACM.
[6]
N. K. Jaiswal,et al.
Priority queues
,
1968
.