• 산업경영시스템학회지
• /
• 제42권4호
• /
• pp.91-105
• /
• 2019

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.

• 대한수학회논문집
• /
• 제32권2호
• /
• pp.425-433
• /
• 2017

This paper is concerned with the analysis of the busy period distribution in a batch arrival $M^X/G/1$ retrial queue. The expression for the Laplace-Stieltjes transform of the length of the busy period is well known, but from this expression we cannot compute the moments of the length of the busy period by direct differentiation. This paper provides a direct method of calculation for the first and second moments of the length of the busy period.

• 한국경영과학회지
• /
• 제32권2호
• /
• pp.141-147
• /
• 2007

We consider a GI/M/1 queue with vacations such that the server works with different rate rather than completely stops working during a vacation period. We derive the transform of the joint distribution of the length of a busy period, the number of customers served during the busy period, and the length of the subsequent idle period.

• 한국경영과학회지
• /
• 제31권1호
• /
• pp.83-90
• /
• 2006

By defining the partial busy period of the M/M/c/K queueing system as the time interval during which at least one server is in service, we derive the first two moments of both the partial busy period and the number of customers served during it. All expressions are given in explicit forms.

• Communications for Statistical Applications and Methods
• /
• 제7권2호
• /
• pp.489-497
• /
• 2000

The M/M/1 queue with impatient customers is studied. Impatient customers wait for service only for limited time K/0 and leave the system if their services do not start during that time. Notice that in the analysis of virtual waiting time, the impatient customer can be considered as the customer who enters the system only when his/her waiting time does not exceed K. In this paper, we apply martingale methods to the virtual waiting time and obtain the expected period from origin to the point where the virtual waiting time crosses over K or reaches 0, and the variance of this period. With this results, we obtain the expected busy period of the queue, the distribution, expectation and variance of the number of times the virtual waiting time exceeding level K during a busy period, and the probability of there being no impatient customers in a busy period.

• 한국시뮬레이션학회논문지
• /
• 제27권3호
• /
• pp.45-52
• /
• 2018

대기행렬에 고객 (또는 패킷 등)이 몰리는 오버로드(overload)가 발생하는 경우 긴 대기열이 발생하여 서비스 품질에 좋지 않은 영향을 줄 수 있다. 오버로드 상황에서 혼잡을 완화하기 위해 대기하는 고객숫자에 기반한 다양한 오버로드 제어 정책들이 고안, 적용되고 있다. 본 연구는 대기 중인 고객 숫자에 한계점 (threshold)을 두고, 한계점을 넘으면 서비스 속도를 빠르게 하거나 고객의 도착 간격(시간)을 증가시키는 제어정책을 대상으로 한다. 이러한 정책을 갖는 M/G/1 대기행렬에 대해 바쁜 기간(busy period)을 분석하는데, 연구결과는 비용구조가 주어졌을 때 최적 시스템 제어 정책을 찾는데 필수적이다.

• 산업경영시스템학회지
• /
• 제38권1호
• /
• pp.21-29
• /
• 2015

A steady-state controllable M/G/1 queueing model operating under the {T:Min(T,N)} policy is considered where the {T:Min(T,N)} policy is defined as the next busy period will be initiated either after T time units elapsed from the end of the previous busy period if at least one customer arrives at the system during that time period, or after T time units elapsed without a customer' arrival, the time instant when Nth customer arrives at the system or T time units elapsed with at least one customer arrives at the system whichever comes first. After deriving the necessary system characteristics including the expected number of customers in the system, the expected length of busy period and so on, the total expected cost function per unit time for the system operation is constructed to determine the optimal operating policy. To do so, the cost elements associated with such system characteristics including the customers' waiting cost in the system and the server's removal and activating cost are defined. Then, procedures to determine the optimal values of the decision variables included in the operating policy are provided based on minimizing the total expected cost function per unit time to operate the queueing system under considerations.

• 산업경영시스템학회지
• /
• 제39권1호
• /
• pp.81-90
• /
• 2016

Different from general operating policies to be applied for controllable queueing models, two of three well-known simple N, T and D operating policies are applied alternatingly to the single server controllable queueing models, so called alternating (NT), (ND) and (TD) policies. For example, the alternating (ND) operating policy is defined as the busy period is initiated by the simple N operating policy first, then the next busy period is initiated by the simple D operating policy and repeats the same sequence after that continuously. Because of newly designed operating policies, important system characteristic such as the expected busy and idle periods, the expected busy cycle, the expected number of customers in the system and so on should be redefined. That is, the expected busy and idle periods are redefined as the sum of the corresponding expected busy periods and idle periods initiated by both one of the two simple operating policies and the remaining simple operating policy, respectively. The expected number of customers in the system is represented by the weighted or pooled average of both expected number of customers in the system when the predetermined two simple operating policies are applied in sequence repeatedly. In particular, the expected number of customers in the system could be used to derive the expected waiting time in the queue or system by applying the famous Little's formulas. Most of such system characteristics derived would play important roles to construct the total cost functions per unit time for determination of the optimal operating policies by defining appropriate cost elements to operate the desired queueing systems.

• 산업경영시스템학회지
• /
• 제37권1호
• /
• pp.96-103
• /
• 2014

A steady-state controllable M/G/1 queueing model operating under the (TN) policy is considered where the (TN) policy is defined as the next busy period will be initiated either after T time units elapsed from the end of the previous busy period if at least one customer arrives at the system during that time period, or the time instant when Nth customer arrives at the system after T time units elapsed without customers' arrivals during that time period. After deriving the necessary system characteristics such as the expected number of customers in the system, the expected length of busy period and so on, the total expected cost function per unit time in the system operation is constructed to determine the optimal operating policy. To do so, the cost elements associated with such system characteristics including the customers' waiting cost in the system and the server's removal and activating cost are defined. Then, the optimal values of the decision variables included in the operating policies are determined by minimizing the total expected cost function per unit time to operate the system under consideration.

• International Journal of Reliability and Applications
• /
• 제12권1호
• /
• pp.15-39
• /
• 2011

This paper deals with the reliability analysis of a complex system with three possibilities at the time of repair. The considered system consists of two subsystems A and Bin series configuration (1-out-of-2: F). Subsystem A has n units which are connected in series whereas subsystem B consists of n units in parallel configuration. The configuration of subsystem A is of 1-out-of-n: F whereas subsystem B is of k-out-of-n: D and k+1-out-of-n: F nature. System has three states: Good, degraded and failed. Supplementary variable technique has been used for mathematical formulation of the model. Laplace transform is being utilized to solve the mathematical equation. Reliability, Availability, M.T.T.F., Busy Period and Cost effectiveness of the system have been computed. The repairs from state $S_7$ to $S_0$, $S_8$ to $S_0$, $S_9$ to $S_0$ and $S_{11}$ to $S_0$ have two types namely exponential and general. Joint probability distribution of repair rate from $S_7$ to $S_0$, $S_8$ to $S_0$, $S_9$ to $S_0$ and $S_{11}$ to $S_0$ is computed by Gumbel-Hougaard family of copula. Some particular cases of the system have also been derived to see the practical importance of the model.