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

• 영문명: M/G/1 Preemptive Priority Queues With Finite and Infinite Buffers
• 발행기관: 한국산업경영시스템학회
• 저자명: 김길환(Kilhwan Kim)
• 간행물 정보: 『산업경영시스템학회지』제43권 제4호, 1~14쪽, 전체 14쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2020.12.30

영문 초록

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.

목차

1. 서 론

2. 모 형

3. 클래스-2 고객의 서비스 시간의 구조

4. 고객 손실 확률과 대기시간의 분포

5. 수치 예제

6. 결 론

References

키워드

M/G/1 Priority Queues Delay Cycle Analysis Preemptive Priority Disciplines Finite and Infinite Buffers