Retrial Queuing System with Randomized Push-Out Mechanism and Non-Preemptive Priority

Korenevskaya, M.; Zayats, Oleg; Ilyashenko, Alexander; Muliukha, Vladimir

doi:10.1016/j.procs.2019.02.016

Cited by 9 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chakravarthy [25] studied a non-preemptive priority queue with two classes of customers and introduced a new dynamic rule to provide services to lower-priority customers in the presence of higher-priority customers. Korenevskaya et al [26] considered a retrial queueing system with Poisson arrival following non-preemptive priority. Recently, Krishnamoorthy and Divya [27] analyzed a queue with non-preemptive priority under a marked Markovian arrival process with a distinct phase-type distribution of services.…”

Section: Literature Reviewmentioning

confidence: 99%

Analysis of M/M/1/N Stochastic Queueing—Inventory System with Discretionary Priority Service and Retrial Facility

Jeganathan

Vidhya²,

Hemavathy³

et al. 2022

Sustainability

View full text Add to dashboard Cite

In this paper, we analyze a queueing–inventory system with two classes of customers, high priority (HP) and low priority (LP), under the discretionary priority discipline. The LP customers are served in two stages: preliminary service in stage-I and main service in stage-II. In contrast, HP customers require only the main service. Whenever the inventory level is less than the threshold level during the stage-I service of an LP customer, an arriving HP customer is allowed to interrupt the service of an LP customer by adopting the mixed-priority discipline. Otherwise, non-preemptive priority discipline is used in both stages. The interrupted LP customer moves to orbit and retries for the service whenever the server is free. The waiting hall of finite capacity is afforded for the HP customer only. The orbital search is provided for LP customers in orbit. The inventory is replenished following the (s,Q) ordering policy, with the lifetimes of the items being exponentially distributed. An expression for the stability condition is determined explicitly, and system performance measures are evaluated. Numerical examples are formulated for different sets of input values of the parameters.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Analysis of M/M/1/N Stochastic Queueing—Inventory System with Discretionary Priority Service and Retrial Facility

Jeganathan

Vidhya²,

Hemavathy³

et al. 2022

Sustainability

View full text Add to dashboard Cite

show abstract

“…Let us assume that first type requests have access to server and buffer, while second type requests -to server and orbit. Let us consider two types of priority scheduling algorithmspreemptive and non-preemptive scheduling [20], [21], [29], [30].…”

Section: Mathematical Modelmentioning

confidence: 99%

“…Due to the "infinite" sizes of buffer and orbit, the stationary probability distributions P = (𝑃 (n)) n∈𝒳 and Q = (𝑄(n)) n∈𝒴 should be computed through generating function-based approaches [25], [27], [29]. However, one can compute them using iteration methods [31], [32] by simply adding limitations to the storage sizes, setting these to random maximum values.…”

Section: Stationary Probability Distributionmentioning

confidence: 99%

See 1 more Smart Citation

Performance analysis of queueing system model under priority scheduling algorithms within 5G networks slicing framework

Adou

Markova

Zhbankova

2022

Discrete and Continuous Models

View full text Add to dashboard Cite

A new era is opening for the world of information and communication technologies with the 5G networks release. Indeed 5G networks appear in modern wireless systems as solutions to traditional networks inflexibility and lack of radio resources problems. Using these networks the operators can expand their services range at will and, therefore, manage daily operations by monitoring key performance indicators (KPIs) - helping meet the quality of service (QoS) requirements much easily. To meet the QoS requirements 5G networks can be implemented alongside priority scheduling algorithms. This paper considers the operation of a wireless network slicing model under two scheduling algorithms. A comparative analysis of main performance measures is provided.

show abstract

Preemptive Priority Queuing System with Randomized Push-Out Mechanism and Negative Customers

Shorenko

Zayats

Ilyashenko

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Retrial Queuing System with Randomized Push-Out Mechanism and Non-Preemptive Priority

Cited by 9 publications

References 8 publications

Analysis of M/M/1/N Stochastic Queueing—Inventory System with Discretionary Priority Service and Retrial Facility

Analysis of M/M/1/N Stochastic Queueing—Inventory System with Discretionary Priority Service and Retrial Facility

Performance analysis of queueing system model under priority scheduling algorithms within 5G networks slicing framework

Preemptive Priority Queuing System with Randomized Push-Out Mechanism and Negative Customers

Contact Info

Product

Resources

About