단일 휴가형 Geo/Geo/1/K 대기행렬의 바쁜 기간 분석
Busy Period Analysis of the Geo/Geo/1/K Queue with a Single Vacation
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
Abstract
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.
참고문헌 (21)
- Al Hanbali, A., "Busy period analysis of the state dependent M", M, K queue, pp.Operations Research Letters, 2010[DOI]
- Al Hanbali, A., "Busy period analysis of the level dependent PH", PH, K queue, pp.Queueing Systems, 2011[DOI]
- Bruneel, H., "Discrete-time models for communication systems including ATM" (1993), Kluwer Academic Publishers
- Chaudhry, M. L., "First-passage-time and busy-period distributions of discrete-time Markovian queues : Geom (n)", Geom (n), n, pp.Queueing Systems, 1994[DOI]
- Cohen, J.W., "The single server queue" (1982), North-Holland Amsterdam
- Cooper, R. B., "On the relationship between the distribution of maximal queue length in the M", G, G, pp.1, N queue[DOI]
- Ferreira, F., "Moments of losses during busy-periods of regular and nonpreemptive oscillating MX", G, n systems, pp.Annals of Operations Research, 2017[DOI]
- Gravey, A., "Simultaneity in discretetime single server queues with Bernoulli inputs", Performance Evaluation, 14(2), pp.123~131 (1992)
- Harchol-Balter, M., "Performance modeling and design of computer systems : Queueing theory in action" (2013), Cambridge University Press
- Harris, T. J., "The remaining busy period of a finite queue", Operations Research, 19(1), pp.219~223 (1971)
- 김길환, "(N, n)-Preemptive Repeat-Different Priority Queues", 한국산업경영시스템학회지, 40(3), pp.66~75 (2017), 한국산업경영시스템학회
- 김길환, "엄격한 T‐축출 우선순위 대기행렬을 이용한 기회 주파수 접근 방식의 성능 분석", 한국산업경영시스템학회지, 35(4), pp.162~170 (2012), 한국산업경영시스템학회[DOI]
- Lee, T. T., "M", G, N queue with vacation time and exhaustive service discipline, pp.Operations Research, 1984[DOI]
- Miller, L. W., "A note on the busy period of an M", G, Operations Research, pp.1975, 23(6)[DOI]
- Pacheco, A., "Moments of the duration of busy periods of Mx", G, N systems, pp.Probability in the Engineering and Informational Sciences, 2008[DOI]
- Shanthikumar, J. G., "On the busy-period distributions of M", G, K queues by state-dependent arrivals and FCFS, pp.LCFS-p service disciplines, Journal of Applied Probability[DOI]
- Takagi, H., "Explicit probability density function for the length of a busy period in an M", M, K queue, pp.Advances in queueing theory and network applications
- Takagi, H, "Queueing analysis, Volume 1 : Vacation and priority systems, part 1" (1991), North-Holland
- Takagi, H, "Queueing analysis, Volume 3 : Discrete-time systems" (1993), North-Holland
- Wilf, H. S., "Generating functionology", pp.2005, AK Peters
- Yu, M., "A simple method to obtain the stochastic decomposition structure of the busy period in Geo", Geo, N vacation queue, pp.4OR, 2015[DOI]