Closed two node priority queueing networks
type: Item
instance of: scholarly article
title: Closed two node priority queueing networks
zbMATH Open document ID: 0667.60090
DOI: 10.1016/0377-2217(89)90103-3
author: M. Rumsewicz
author: William Henderson
published in: European Journal of Operational Research
publication date: 1989-01-01T00:00:00Z
review text: Exact equilibrium distributions are found for a closed Markov queueing system consisting of two nodes and two priority classes having different service time parameters and a preemptive discipline. Writing the matrix form of the global equilibrium equations reveals symmetries that facilitate a solution. This result is then extended to certain state- dependent cases involving non-preemptive as well as preemptive models. A comparison with the approximate solution by \textit{R. J. T. Morris} [Bell. Syst. Tech. J. 60, 1745-1769 (1981; Zbl 0464.90026)] is undertaken. It is noted that the throughput provided by the approximation yields anomalous results in some regions of service rates. Moreover, throughput for the low priority class is not always improved by increasing the relevant service rate. Finally, it is noted that the exact calculation involves little more computation time than the Morris approximation.
Mathematics Subject Classification ID: 60K20
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 60J25
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 4092524
zbMATH Keywords: priority queues
zbMATH Keywords: balance equation
zbMATH Keywords: equilibrium distributions
zbMATH Keywords: closed Markov queueing system
reviewed by: Frederick J. Beutler
MaRDI profile type: Publication
full work available at URL: 0377-2217(89)90103-3
OpenAlex ID: W2026944071
cites work: Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
cites work: Finite birth-and-death models in randomly changing environments
cites work: Insensitivity and reversed Markov processes
cites work: Priority queues
cites work: Q3855869
cites work: Priority Queuing Networks
cites work: Q3923308
cites work: The insensitivity of stationary probabilities in networks of queues
description: scientific article; zbMATH DE number 4092524