Closed two node priority queueing networks (Q1117600): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Open, Closed, and Mixed Networks of Queues with Different Classes of Customers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite birth-and-death models in randomly changing environments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Insensitivity and reversed Markov processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Priority queues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3855869 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Priority Queuing Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3923308 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The insensitivity of stationary probabilities in networks of queues / rank | |||
Normal rank |
Latest revision as of 14:36, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Closed two node priority queueing networks |
scientific article |
Statements
Closed two node priority queueing networks (English)
0 references
1989
0 references
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.
0 references
priority queues
0 references
balance equation
0 references
equilibrium distributions
0 references
closed Markov queueing system
0 references