Authors:
Preeti,Deepak Gupta,Vandana Saini,DOI NO:
https://doi.org/10.26782/jmcms.2025.07.00009Keywords:
Feedback,Generating function techniques,Priority,Queueing,Serial Channel,Stochastic condition,Abstract
This paper presents a comprehensive analysis of a feedback queue model with a Priority mechanism and investigates its behavior under stochastic conditions. This model comprises two serially connected service channels, with priority applied exclusively to the first service channel. Upon entry, customers are classified into two groups-low and high priority. A preemptive priority discipline is used at the first server to distinguish between high- and low-priority customers, thereby reflecting real-world service hierarchies. The feedback mechanism in the model allows for a maximum of one time only for the customer’s satisfaction with the service. The arrival of the customers is governed by a Poisson process and and service times at both servers are assumed to follow independently and be exponentially distributed. Upon service completion at the second server, customers may either exit the system permanently or re-enter the network through a feedback loop. The Steady-state behavior of the system is captured through a set of differential equations, which are solved by using the generating function technique combined with classical calculus laws. Various queue performance indicators, including average queue length, variance in queues, server utilization, and total duration time, are discussed. In the last section, a comparative study of the model with the literature is also discussed. The model’s behaviour is well demonstrated both graphically and numerically and provides an in-depth understanding of how each parameter influences the overall system performance, and the obtained results prove the stability and accuracy of the model. The insights derived from the analysis could help understand the design and optimization of the queueing model in different settings such as hospitals, manufacturing industries, and telecommunications.Refference:
I. Ajewole, O. R., C. O. Mmduakor, E. O. Adeyefa, J. O. Okoro, and T. O. Ogunlade. “Preemptive-Resume Priority Queue System with Erlang Service Distribution.” Journal of Theoretical and Applied Information Technology, vol. 99, no. 6, 2021, pp. 1426–1434.
II. Agarwal, A., R. Agarwal, and S. Upadhyaya. “Detection of Optimal Working Vacation Service Rate for Retrial Priority G-Queue with Immediate Bernoulli Feedback.” Results in Control and Optimization, vol. 14, 2024, p. 100397. 10.1016/j.rico.2024.100397.
III. Dudin, A., O. Dudina, S. Dudin, and K. Samouylov. “Analysis of Single-Server Multi-Class Queue with Unreliable Service, Batch Correlated Arrivals, Customer’s Impatience and Dynamical Change of Priorities.” Mathematics, vol. 9, no. 1257, 2021, pp. 1–17. 10.3390/math9111257.
IV. Finch, P. D. “Cyclic Queues with Feedback.” Journal of the Royal Statistical Society: Series B (Methodological), vol. 21, no. 1, 1959, pp. 153–157. https://www.jstor.org/stable/i349709.
V. Gupta, Renu. Queue Network Models and Their Applications. 2023. Maharishi Markandeshwar University, Mullana, PhD dissertation. http://hdl.handle.net/10603/472701.
VI. Gupta, R., and D. Gupta. “Steady State Analysis of Biserial Server with Bulk Arrival.” International Journal of Mathematics Trends and Technology, vol. 56, no. 6, 2018, pp. 430–436.
VII. Jackson, R. R. P. “Queuing System with Phase Type Services.” O.R. Quarterly, vol. 5, 1954, pp. 109–120. 10.2307/3007088.
VIII. Kusum. Mathematical Modeling of Feedback and Fuzzy Queue Network. PhD thesis, Maharishi Markandeshwar University, Department of Mathematics, 2012. http://hdl.handle.net/10603/10532.
IX. Kumar, S., and G. Taneja. “A Feedback Queuing Model with Chances of Providing Service at Most Twice by One or More out of Three Servers.” Aryabhatta Journal of Mathematics and Informatics, vol. 9, no. 1, 2017, pp. 171–184.
X. Kumar, S., and G. Taneja. “A Feedback Queueing Model with Chance of Providing Service at Most Twice by One or More out of Three Servers.” International Journal of Applied Engineering Research, vol. 13, no. 17, 2018, pp. 13093–13102.
XI. Lee, S., A. Dudin, and O. Dudina. “Analysis of a Priority Queueing System with the Enhanced Fairness of Servers Scheduling.” Journal of Ambient Intelligence and Humanized Computing, vol. 15, no. 1, 2024, pp. 465–477. https://doi.org/10.1007/s12652-022-03903-z.
XII. Luo, C., Y. Tang, and C. Li. “Transient Queue Size Distribution Solution of Geom/G/1 Queue with Feedback, a Recursive Method.” Journal of Systems Science and Complexity, vol. 22, 2009, pp. 303–312. 10.1007/s11424-009-9165-7.
XIII. O’Brien, G. G. “The Solution of Some Queueing Problems.” Journal of the Society for Industrial and Applied Mathematics, vol. 2, no. 3, 1954, pp. 133–142. 10.1137/0102010.
XIV. Peng, Y. “On the Discrete-Time Geo/G/1 Retrial Queueing System with Preemptive Resume and Bernoulli Feedback.” OPSEARCH, vol. 53, 2016, pp. 116–130. 10.1007/s12597-015-0218-5.
XV. Saini, A., D. Gupta, and A. K. Tripathi. “Analytical Study of Two Serial Channels with Priority and Reneging.” International Journal on Recent and Innovation Trends in Computing and Communication, vol. 11, no. 6, 2023, pp. 89–93. 10.17762/ijritcc.v11i6.7237.
XVI. Saini, V., D. Gupta, and A. K. Tripathi. “Analysis of Feedback Queue System Comprised of Two Serial Servers with Impatient Customers.” Aryabhatta Journal of Mathematics and Informatics, vol. 14, no. 2, 2022, pp. 145–152.
XVII. Sangeeta, S., M. Singh, and D. Gupta. “Analysis of Serial Queues with Discouragement, Reneging and Feedback.” AIP Conference Proceedings, vol. 2735, no. 1, 2023. 10.1063/12.0016682.
XVIII. Shree, V., S. Upadhyaya, and R. Kulshrestha. “Cost Scrutiny of Discrete-Time Priority Queue with Cluster Arrival and Bernoulli Feedback.” OPSEARCH, 2024, pp. 1–34. 10.1007/s12597-024-00742-8.
XIX. Singh, T. P. “Steady State Analysis of Heterogeneous Feedback Queue Model.” Proceedings of International Conference on Intelligence System and Network (ISTK), 2011.
XX. Singh, T. P., and A. Tyagi. “Cost Analysis of a Queue System with Impatient Customer.” Aryabhatta Journal of Mathematics and Informatics, vol. 6, no. 2, 2013, pp. 309–312.
XXI. Xu, J., and L. Liu. “Analysis of a Two-Stage Tandem Queuing System with Priority and Clearing Service in the Second Stage.” Mathematics, vol. 12, no. 10, 2024, p. 1500. 10.3390/math121015.
XXII. Zadeh, A. B. “A Batch Arrival Multi-Phase Queueing System with Random Feedback in Service and Single Vacation Policy.” OPSEARCH, vol. 52, 2015, pp. 617–630. 10.1007/s12597-015-0206-9