DOI QR코드

DOI QR Code

M/G/1 Preemptive Priority Queues With Finite and Infinite Buffers

유한 및 무한 용량 대기열을 가지는 선점 우선순위 M/G/1 대기행렬

  • Kim, Kilhwan (Department of Management Engineering, Sangmyung University)
  • Received : 2020.11.13
  • Accepted : 2020.12.18
  • Published : 2020.12.31

Abstract

Recently, M/G/1 priority queues with a finite buffer for high-priority customers and an infinite buffer for low-priority customers have applied to the analysis of communication systems with two heterogeneous traffics : delay-sensitive traffic and loss-sensitive traffic. However, these studies are limited to M/G/1 priority queues with finite and infinite buffers under a work-conserving priority discipline such as the nonpreemptive or preemptive resume priority discipline. In many situations, if a service is preempted, then the preempted service should be completely repeated when the server is available for it. This study extends the previous studies to M/G/1 priority queues with finite and infinite buffers under the preemptive repeat-different and preemptive repeat-identical priority disciplines. We derive the loss probability of high-priority customers and the waiting time distributions of high- and low-priority customers. In order to do this, we utilize the delay cycle analysis of finite-buffer M/G/1/K queues, which has been recently developed for the analysis of M/G/1 priority queues with finite and infinite buffers, and combine it with the analysis of the service time structure of a low-priority customer for the preemptive-repeat and preemptive-identical priority disciplines. We also present numerical examples to explore the impact of the size of the finite buffer and the arrival rates and service distributions of both classes on the system performance for various preemptive priority disciplines.

Keywords

References

  1. Al-Begain, K., Dudin, A., Kazimirsky, A., and Yerima, S., Investigation of the M2/G2/1/∞, N queue with restricted admission of priority customers and its application to HSDPA mobile systems, Computer Networks, 2009, Vol. 53, No. 8, pp. 1186-1201. https://doi.org/10.1016/j.comnet.2009.02.017
  2. Chakravarthy, S.R., A dynamic non-preemptive priority queueing model with two types of customers, International Conference on Mathematics and Computing, 2018, pp. 23-42.
  3. Conway, R.W., Maxwell, W.L., and Miller, L.W., Theory of scheduling, Addison-Wesley, 1967.
  4. Demoor, T., Walraevens, J., Fiems, D., De Vuyst, S., and Bruneel, H., Influence of real-time queue capacity on system contents in DiffServ's expedited forwarding per-hop-behavior, Journal of Industrial and Management Optimization, 2010, Vol. 6, No. 3, pp. 587-602. https://doi.org/10.3934/jimo.2010.6.587
  5. Drekic, S. and Stanford, D.A., Reducing delay in preemptive repeat priority queues, Operations Research, 2001, Vol. 49, pp. 145-156. https://doi.org/10.1287/opre.49.1.145.11186
  6. Jaiswal, N.K., Priority queues, Academic Press, 1968.
  7. Kim, K., Delay cycle analysis of finite-buffer M/G/1 queues and its application to the analysis of M/G/1 priority queues with finite and infinite buffers, Performance Evaluation, 2020, Vol. 143, pp. 102133. https://doi.org/10.1016/j.peva.2020.102133
  8. 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
  9. Kim, K., (N, n)-preemptive repeat-different priority queues, Journal of Society of Korea Industrial and Systems Engineering, 2017, Vol. 40, No. 3, pp. 66-75. https://doi.org/10.11627/jkise.2017.40.3.066
  10. 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
  11. 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
  12. 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
  13. Miao, W., Min, G., Wu, Y., and Wang, H., Performance modelling of preemption-based packet scheduling for data plane in software defined networks, 2015 IEEE international conference on Smart City/SocialCom/Sustain Com(SmartCity), 2015, pp. 60-65.
  14. Pandey, S.R., Alsenwi, M., Tun, Y.K., and Hong, C.S., A downlink resource scheduling strategy for URLLC traffic, 2019 IEEE International Conference on Big Data and Smart Computing(bigcomp), 2019, pp. 1-6.
  15. Parkvall, S., Dahlman, E., Furuskar, A., and Frenne, M., NR : The new 5G radio access technology, IEEE Communications Standards Magazine, 2017, Vol. 1, No. 4, pp. 24-30. https://doi.org/10.1109/mcomstd.2017.1700042
  16. Sachs, J., Wikstrom, G., Dudda, T., Baldemair, R., and Kittichokechai, K., 5G radio network design for ultra-reliable low-latency communication, IEEE Network, 2018, Vol. 32, No. 2, pp. 24-31. https://doi.org/10.1109/MNET.2018.1700232
  17. Van Velthoven, J., Van Houdt, B., and Blondia, C., The impact of buffer finiteness on the loss rate in a priority queueing system, European Performance Engineering Workshop, 2006, pp. 211-225.
  18. Willinger, W., Paxson, V., and Taqqu, M.S., Self-similarity and heavy tails : Structural modeling of network traffic, A Practical Guide to Heavy Tails : Statistical Techniques and Applications, 1998, Vol. 23, pp. 27-53.
  19. Wu, W.-R., Lin, T.-H., and Lee, Y.-H., An indicator-free eMBB and URLLC multiplexed downlink system with correlation-based sfbc, Proceedings of the 3rd International Conference on Telecommunications and Communication Engineering, 2019, pp. 105-110.
  20. Yang, W., Li, C.-P., Fakoorian, A., Hosseini, K., and Chen, W., Dynamic URLLC and eMBB multiplexing design in 5G new radio, 2020 IEEE 17th Annual Consumer Communications & Networking Conference(CCNC), 2020, pp. 1-5.
  21. Zhou, Z., Yan, Y., Ruepp, S., and Berger, M., Analysis and implementation of packet preemption for time sensitive networks, 2017 IEEE 18th International Conference on High Performance Switching and Routing(HPSR), 2017, pp. 1-6.