Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지
DOI QR코드

DOI QR Code

(N, n)-Preemptive Repeat-Different Priority Queues

(N, n)-선점 재샘플링-반복 우선순위 대기행렬

  • Kim, Kilhwan (Department of Management Engineering, Sangmyung University)
  • Received : 2017.07.12
  • Accepted : 2017.08.16
  • Published : 2017.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

Priority disciplines are an important scheme for service systems to differentiate their services for different classes of customers. (N, n)-preemptive priority disciplines enable system engineers to fine-tune the performances of different classes of customers arriving to the system. Due to this virtue of controllability, (N, n)-preemptive priority queueing models can be applied to various types of systems in which the service performances of different classes of customers need to be adjusted for a complex objective. In this paper, we extend the existing (N, n)-preemptive resume and (N, n)-preemptive repeat-identical priority queueing models to the (N, n)-preemptive repeat-different priority queueing model. We derive the queue-length distributions in the M/G/1 queueing model with two classes of customers, under the (N, n)-preemptive repeat-different priority discipline. In order to derive the queue-length distributions, we employ an analysis of the effective service time of a low-priority customer, a delay cycle analysis, and a joint transformation method. We then derive the first and second moments of the queue lengths of high- and low-priority customers. We also present a numerical example for the first and second moments of the queue length of high- and low-priority customers. Through doing this, we show that, under the (N, n)-preemptive repeat-different priority discipline, the first and second moments of customers with high priority are bounded by some upper bounds, regardless of the service characteristics of customers with low priority. This property may help system engineers design such service systems that guarantee the mean and variance of delay for primary users under a certain bounds, when preempted services have to be restarted with another service time resampled from the same service time distribution.

Keywords

References

  1. Adiri, I. and Domb, I., A Single Server Queueing System Working under Mixed Priority Disciplines, Operations Research, 1982, Vol. 30, No. 1, pp. 97-115. https://doi.org/10.1287/opre.30.1.97
  2. Adiri, I. and Domb, I., Mixing of Non-Preemptive and Preemptive Repeat Priority Disciplines, European Journal of Operational Research, 1984, Vol. 18, No. 1, pp. 86-97. https://doi.org/10.1016/0377-2217(84)90266-2
  3. Avi-Itzhak, B., Brosh, I., and Naor, P., On Discretionary Priority Queueing, ZAMM-Journal of Applied Mathematics and Mechanics, 1964, Vol. 44, No. 6, pp. 235-242. https://doi.org/10.1002/zamm.19640440603
  4. Cho, Y.Z. and Un, C.K., Analysis of the M/G/1 Queue under a Combined Preemptive/Nonpreemptive Priority Discipline, IEEE Transactions on Communications, 1993, Vol. 41, No. 1, pp. 132-141. https://doi.org/10.1109/26.212373
  5. Conway, R.W., Maxwell, W.L., and Miller, L.W., Theory of scheduling, Reading, MA : Addison-Wesley, 1967.
  6. Drekic, S. and Stanford, D.A., Reducing Delay in Preemptive Repeat Priority Queues, Operations Research, 2001, Vol. 49, No, 1, pp. 145-156. https://doi.org/10.1287/opre.49.1.145.11186
  7. Drekic, S. and Stanford, D.A., Threshold-Based Interventions to Optimize Performance in Preemptive Priority Queues, Queueing Systems, 2000, Vol. 35, No. 1, pp. 289-315. https://doi.org/10.1023/A:1019106530558
  8. Drekic, S., A Preemptive Resume Queue with an Expiry Time for Retained Service, Performance Evaluation, 2003, Vol. 54, No. 1, pp. 59-74. https://doi.org/10.1016/S0166-5316(02)00232-8
  9. Dudin, A., Lee, M.H., Dudina, O., and Lee, S.K., Analysis of Priority Retrial Queue with Many Types of Customers and Servers Reservation as a Model of Cognitive Radio System, IEEE Transactions on Communications, 2017, Vol. 65, No. 1, pp. 186-199. https://doi.org/10.1109/TCOMM.2016.2606379
  10. Gao, S., A Preemptive Priority Retrial Queue with Two Classes of Customers and General Retrial Times, Operational Research, 2015, Vol. 15, No. 2, pp. 233-251. https://doi.org/10.1007/s12351-015-0175-z
  11. Gay, T.W. and Seeman. P.H., Composite Priority Queue, IBM Journal of Research and Development, 1975, Vol. 19, No. 1, pp. 78-81. https://doi.org/10.1147/rd.191.0078
  12. Jouini, O. and Roubos, A., On Multiple Priority Multi-Server Queues with Impatience, Journal of the Operational Research Society, 2014, Vol. 65, No. 5, pp. 616-632. https://doi.org/10.1057/jors.2012.153
  13. Kim, K. and Chae, K.C., Discrete-Time Queues with Discretionary Priorities, European Journal of Operational Research, 2010, Vol. 200, No. 2, pp. 473-485. https://doi.org/10.1016/j.ejor.2008.12.035
  14. Kim, K., (N, n)-Preemptive Priority Queues, Performance Evaluation, 2011, Vol. 68, No. 7, pp. 575-585. https://doi.org/10.1016/j.peva.2011.03.006
  15. Kim, K., The Analysis of an Opportunistic Spectrum Access with a Strict T-preemptive Priority Discipline, Journal of Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 4, pp. 162-170. https://doi.org/10.11627/jkise.2012.35.4.162
  16. Kim, K., T-Preemptive Priority Queue and Its Application to the Analysis of an Opportunistic Spectrum Access in Cognitive Radio Networks, Computers & Operations Research, 2012, Vol. 39, No. 7, pp. 1394-1401. https://doi.org/10.1016/j.cor.2011.08.008
  17. Lee, Y. and Lee, K.-S., Discrete-Time Queue with Preemptive Repeat Different Priority, Queueing Systems, 2003, Vol. 44. No. 4, pp. 399-411. https://doi.org/10.1023/A:1025199506212
  18. Ma, Z., Hao, Y., Wang, P., and Cui, G., Analysis of the Geom/Geom/1 Queue under (N, n)-Preemptive Priority Discipline, Journal of Information & Computational Science, 2015, Vol. 12, No. 3, pp. 1029-1036. https://doi.org/10.12733/jics20105437
  19. Ma, Z., Zheng, X., Xu, M., and Wang, W., Performance Analysis and Optimization of the (N, n)-Preemptive Priority Queue with Multiple Working Vacation, ICIC Express Letters, 2016, Vol. 10, No. 11, pp. 2735-2741.
  20. Paterok, M. and Ettl, M., Sojourn Time and Waiting Time Distributions for M/GI/1 Queues with Preemption-Distance Priorities, Operations Research, 1994, Vol. 42, No. 6, pp. 1146-1161. https://doi.org/10.1287/opre.42.6.1146
  21. Sharif, A.B., Stanford, D.A., Taylor, P., and Ziedins, I., A Multi-Class Multi-Server Accumulating Priority Queue with Application to Health Care, Operations Research for Health Care, 2014, Vol. 3, No. 2, pp. 73-79. https://doi.org/10.1016/j.orhc.2014.01.002
  22. Stanford, D.A., Taylor, P., and Ziedins, I., Waiting Time Distributions in the Accumulating Priority Queue, Queueing Systems, 2014, Vol. 77, No. 3, pp. 297-330. https://doi.org/10.1007/s11134-013-9382-6
  23. Takagi, H., Queueing Analysis, Volume 1 : Vacation and Priority Systems, Part 1. Amsterdam : North-Holland, 1991.
  24. Walraevens, J., Maertens, T., and Bruneel, H., A Semi-Preemptive Priority Scheduling Discipline : Performance Analysis, European Journal of Operational Research, 2013, Vol. 224, No. 2, pp. 324-332. https://doi.org/10.1016/j.ejor.2012.08.008
  25. Walraevens, J., Steyaert, B., and Bruneel, H., A Preemptive Repeat Priority Queue with Resampling : Performance Analysis, Annals of Operations Research, 2006, Vol. 146, No. 1, pp. 189-202. https://doi.org/10.1007/s10479-006-0053-4

Cited by

  1. 단일 휴가형 Geo/Geo/1/K 대기행렬의 바쁜 기간 분석 vol.42, pp.4, 2017, https://doi.org/10.11627/jkise.2019.42.4.091
  2. 유한 및 무한 용량 대기열을 가지는 선점 우선순위 M/G/1 대기행렬 vol.43, pp.4, 2020, https://doi.org/10.11627/jkise.2020.43.4.001