A preemptive resume priority retrial queue with state dependent arrivals, unreliable server and negative customers (Q384517): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
An \(\mathrm{M}/\mathrm{G}/1\) queue serving two priority classes of customers which possesses complex additional features is considered. High priority customers (P1) have preemptive (resume) priority over low priority customers (P2). Service time distributions are type-dependent, arrival processes for the two classes are Poisson, modulated by the internal state of the system. There is an ordinary queue, which P1-customers always join, and a retrial queue, which P2-customers join if they find the server busy at their arrival instant. There are additional negative arrivals which delete P1 customers in service, if any, and vanish thereafter. The server is unreliable and breaks down after a random time and has to be repaired then, the repair time is random. Whenever the server becomes idle it takes a single vacation of random duration. Assuming standard independence assumptions and a supplementary variable technique, the author develops a Markov process description of the system and derives ergodicity conditions which are rather complex. Steady state analysis is performed using standard generating function methods. It is shown that the stationary state distribution decomposes into a sum of two independent components which have a direct interpretation. From the analytical results, performance and reliability measures are derived. | |||
Property / review text: An \(\mathrm{M}/\mathrm{G}/1\) queue serving two priority classes of customers which possesses complex additional features is considered. High priority customers (P1) have preemptive (resume) priority over low priority customers (P2). Service time distributions are type-dependent, arrival processes for the two classes are Poisson, modulated by the internal state of the system. There is an ordinary queue, which P1-customers always join, and a retrial queue, which P2-customers join if they find the server busy at their arrival instant. There are additional negative arrivals which delete P1 customers in service, if any, and vanish thereafter. The server is unreliable and breaks down after a random time and has to be repaired then, the repair time is random. Whenever the server becomes idle it takes a single vacation of random duration. Assuming standard independence assumptions and a supplementary variable technique, the author develops a Markov process description of the system and derives ergodicity conditions which are rather complex. Steady state analysis is performed using standard generating function methods. It is shown that the stationary state distribution decomposes into a sum of two independent components which have a direct interpretation. From the analytical results, performance and reliability measures are derived. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Hans Daduna / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60K25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B22 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6234083 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
retrial queue | |||
Property / zbMATH Keywords: retrial queue / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
unreliable server | |||
Property / zbMATH Keywords: unreliable server / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
negative customers | |||
Property / zbMATH Keywords: negative customers / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
state-dependent arrivals | |||
Property / zbMATH Keywords: state-dependent arrivals / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
preemptive resume priority | |||
Property / zbMATH Keywords: preemptive resume priority / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
single vacation | |||
Property / zbMATH Keywords: single vacation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
stochastic decomposition | |||
Property / zbMATH Keywords: stochastic decomposition / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
steady state analysis | |||
Property / zbMATH Keywords: steady state analysis / rank | |||
Normal rank |
Revision as of 13:32, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A preemptive resume priority retrial queue with state dependent arrivals, unreliable server and negative customers |
scientific article |
Statements
A preemptive resume priority retrial queue with state dependent arrivals, unreliable server and negative customers (English)
0 references
28 November 2013
0 references
An \(\mathrm{M}/\mathrm{G}/1\) queue serving two priority classes of customers which possesses complex additional features is considered. High priority customers (P1) have preemptive (resume) priority over low priority customers (P2). Service time distributions are type-dependent, arrival processes for the two classes are Poisson, modulated by the internal state of the system. There is an ordinary queue, which P1-customers always join, and a retrial queue, which P2-customers join if they find the server busy at their arrival instant. There are additional negative arrivals which delete P1 customers in service, if any, and vanish thereafter. The server is unreliable and breaks down after a random time and has to be repaired then, the repair time is random. Whenever the server becomes idle it takes a single vacation of random duration. Assuming standard independence assumptions and a supplementary variable technique, the author develops a Markov process description of the system and derives ergodicity conditions which are rather complex. Steady state analysis is performed using standard generating function methods. It is shown that the stationary state distribution decomposes into a sum of two independent components which have a direct interpretation. From the analytical results, performance and reliability measures are derived.
0 references
retrial queue
0 references
unreliable server
0 references
negative customers
0 references
state-dependent arrivals
0 references
preemptive resume priority
0 references
single vacation
0 references
stochastic decomposition
0 references
steady state analysis
0 references