단일 휴가형 Geo/Geo/1/K 대기행렬의 바쁜 기간 분석

• 영문명: Busy Period Analysis of the Geo/Geo/1/K Queue with a Single Vacation
• 발행기관: 한국산업경영시스템학회
• 저자명: 김길환(Kilhwan Kim)
• 간행물 정보: 『산업경영시스템학회지』제42권 제4호, 91~105쪽, 전체 15쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2019.12.30

영문 초록

Discrete-time Queueing models are frequently utilized to analyze the performance of computing and communication systems. The length of busy period is one of important performance measures for such systems. In this paper, we consider the busy period of the Geo/Geo/1/K queue with a single vacation. We derive the moments of the length of the busy (idle) period, the number of customers who arrive and enter the system during the busy (idle) period and the number of customers who arrive but are lost due to no vacancies in the system for both early arrival system (EAS) and late arrival system (LAS). In order to do this, recursive equations for the joint probability generating function of the busy period of the Geo/Geo/1/K queue starting with n, 1≤n≤K, customers, the number of customers who arrive and enter the system, and arrive but are lost during that busy period are constructed. Using the result of the busy period analysis, we also numerically study differences of various performance measures between EAS and LAS. This numerical study shows that the performance gap between EAS and LAS increases as the system capacity K decrease, and the arrival rate (probability) approaches the service rate (probability). This performance gap also decreases as the vacation rate (probability) decrease, but it does not shrink to zero.

목차

1. 서 론

2. 모형

3. 유휴기간 분석

4. 바쁜 기간 분석

5. 수치 예제

6. 결 론

키워드

Finite-Buffer Discrete-Time Queues Busy Period Analysis Geo/Geo/1/K Queues EAS vs. LAS Discrete-Time Queues Single Vacation