유한 및 무한 용량 대기열을 가지는 선점 우선순위 M/G/1 대기행렬
M/G/1 Preemptive Priority Queues With Finite and Infinite Buffers
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (21)
- Al-Begain, K., "Investigation of the M2", G2, ∞, N queue with re- stricted admission of priority customers and its application to HSDPA mobile systems, pp.Computer Networks, 2009[DOI]
- Chakravarthy, S.R., "A dynamic non-preemptive priority queueing model with two types of customers", International Conference on Mathematics and Computing, pp.23~42 (2018)
- Conway, R. W., "Theory of scheduling" (1967), Addison-Wesley
- Demoor, T., "Influence of real-time queue capacity on system contents in DiffServ’s expedited forwarding per-hop-behavior", Journal of Industrial and Management Optimization, 6(3), pp.587~602 (2010)
- Drekic, S., "Reducing delay in pre-emptive repeat priority queues", Operations Research, 49, pp.145~156 (2001)
- Jaiswal, N. K., "Priority queues" (1968), Academic Press
- Kim, K., "Delay cycle analysis of finite-buffer M", G, G, pp.1 pri-ority queues with finite and infinite buffers, Perfor-mance Evaluation[DOI]
- Kim, K., "(N, n)-preemptive priority queues", Perfor- mance Evaluation, 68(7), pp.575~585 (2011)
- 김길환, "(N, n)-Preemptive Repeat-Different Priority Queues", 한국산업경영시스템학회지, 40(3), pp.66~75 (2017), 한국산업경영시스템학회
- 김길환, "엄격한 T‐축출 우선순위 대기행렬을 이용한 기회 주파수 접근 방식의 성능 분석", 한국산업경영시스템학회지, 35(4), pp.162~170 (2012), 한국산업경영시스템학회[DOI]
- Kim, K., "T-preemptive priority queue and its application to the analysis of an opportunistic spectrum access in cognitive radio networks", Computers & Operations Rese- arch, 39(7), pp.1394~1401 (2012)
- Kim, K., "Discrete-time queues with dis-cretionary priorities", European Journal of Operational Research, 200(2), pp.473~485 (2010)
- Miao, W., "Performance modelling of preemption-based packet scheduling for data plane in software defined networks", 2015 IEEE international conference on Smart City, SustainCom(SmartCity), pp.2015[DOI]
- Pandey, S.R., "A downlink resource scheduling strategy for URLLC traffic", 2019 IEEE International Conference on Big Data and Smart Computing(bigcomp), pp.1~6 (2019)
- Parkvall, S., "NR : The new 5G radio access technology", IEEE Communications Standards Magazine, 1(4), pp.24~30 (2017)
- Sachs, J., "5G radio network design for ultrareliable low-latency communication", IEEE Network, 32(2), pp.24~31 (2018)
- Van Velthoven, J., "The impact of buffer finiteness on the loss rate in a priority queueing system", European Performance Engineering Workshop, pp.211~225 (2006)
- Willinger, W., "Self-similarity and heavy tails : Structural modeling of network traffic", A Practical Guide to Heavy Tails : Statistical Techniques and Applications, 23, pp.27~53 (1998)
- Wu, W.-R., "An indicator-free eMBB and URLLC multiplexed downlink system with correlation-based sfbc", Proceedings of the 3rd International Conference on Telecommunications and Communi- cation Engineering, pp.105~110 (2019)
- Yang, W., "Dynamic URLLC and eMBB multiplexing design in 5G new radio", 2020 IEEE 17th Annual Consu- mer Communications & Networking Conference(CCNC), pp.1~5 (2020)
- Zhou, Z., "Analysis and implementation of packet preemption for time sen- sitive networks", 2017 IEEE 18th International Confe- rence on High Performance Switching and Routing(HPSR), pp.1~6 (2017)