• 한국경영과학회지
• /
• 제19권3호
• /
• pp.235-241
• /
• 1994

We consider a B/G/1 queueing with vacations, where the server closes the gate when it begins a vacation. In this system, customers arrive according to a Bernoulli process. The service time and the vacation time follow discrete distributions. We obtain the distribution of the number of customers at a random point in time, and in turn, the distribution of the residence time (queueing time + service time) for a customer. It is observed that solutions for our discret time B/G/1 gated vacation model are analogous to those for the continuous time M/G/1 gated vacation model.

• Journal of the Korean Statistical Society
• /
• 제24권1호
• /
• pp.19-29
• /
• 1995

In this paper, we investigate the asymptotic distributions of maximum queue length for M/G/1 and GI/M/1 systems which are positive recurrent. It is well knwon that for any positive recurrent queueing systems, the distributions of their maxima linearly normalized do not have non-degenerate limits. We show, however, that by concerning an array of queueing processes limiting behaviors of these maximum queue lengths can be established under certain conditions.

• Journal of applied mathematics & informatics
• /
• 제1권1호
• /
• pp.55-74
• /
• 1994

We consider an M/G/1 queueing system with multiple priority classes of jobs. Considered preemptive rules are the preemptive-resume preemptive-repeat-identical, and preemptive-repeat-different policies. These three preemptive rules will be analyzed in parallel. The key idea of analysis is based on the consideration of a busy period as composite of delay cycle. As results we present the exact Laplace-Stieltjecs(L.S) transforms of residence time and completion time in the system.

• Journal of applied mathematics & informatics
• /
• 제26권3_4호
• /
• pp.721-732
• /
• 2008

A single server infinite capacity queueing system with Poisson arrival and a general service time distribution along with repeated attempt and server vacation is considered. We made a comprehensive analysis of the system including ergodicity and limiting behaviour. Some operating characteristics are derived and numerical results are presented to test the feasibility of the queueing model.

• 한국경영과학회지
• /
• 제22권2호
• /
• pp.45-65
• /
• 1997

We build a queueing model for buffered leaky bucket system. First, we set up system equations and them calculate the steady-state probabilities at an arbitrary time epoch by recursive method. We derive the mean waiting time and the mean number of cells in the input buffer, and evaluate the performance of the buffered leaky bucket system to find the optimal queue capacity and token generation rate that meet the quality of service(QoS).

• 한국군사과학기술학회지
• /
• 제21권4호
• /
• pp.489-496
• /
• 2018

In this paper, a performance comparison of dynamic TDMA and fixed TDMA in tactical data link system is conducted. The performance metric include: delay, queue size and system throughput. To perform comparison of two TDMA schemes, we adopt the modified M/D/1 queueing model. Computer simulation is also performed to verify conducted analytical results.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2001년도 The Seoul International Simulation Conference
• /
• pp.359-364
• /
• 2001

In this study, we try to improve the accuracy of QN-GPH by the help of simulation approach. We first establish an estimation method for GPH distributions with sufficient accuracy based on empirical distribution, and then perform a brief trial run to find appropriate empirical distributions. After getting GPH form of distributions, we continue the QN-GPH analytic steps and compute necessary performance measures. We apply the method to find sojourn time distributions in a 8-node queueing system and compare the results with the whole simulation and the original two-parametric approximation.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2001년도 The Seoul International Simulation Conference
• /
• pp.396-402
• /
• 2001

In various applications of queueing systems, admission control is often employed. It is known that the threshold-type of admission control is optimal in many practical applications despite its simplicity. However, determining the optimal threshold value is hard in general, because analytical expressions for the stationary queue length distributions are not easily available in most queueing systems. In this paper, to quickly determine the optimal threshold value under threshold-type admission control, we develop a concurrent simulation technique, which can save large amount of CPU time required in simulation, compared to the standard simulation procedure.

• 산업경영시스템학회지
• /
• 제13권22호
• /
• pp.87-98
• /
• 1990

The performance analysis and capacity planning of Service Control Point which is real time response system is studied. The system is modeled by multiclass open queueing network. The analytical method is used to solve the queueing network. The solution of the model has product form solution. The focus of this paper is to investigate the capacity of system under the restriction of response time. To get the reasonable capacities, nonlinear programming problem is formulated and is solved by GINO. And the simulation model using SLAM II is formulated.

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2003년도 춘계 학술발표회 논문집
• /
• pp.203-206
• /
• 2003

This paper studies constrained optimization of an M/G/1 queue with a server that can be switched on and off. One criterion is an average number of customers in the system and another criterion is an average operating cost per unit time, where operating costs consist of switching and running costs. With the help of queueing theory, we solve the problems of optimization of one of these criteria under a constraint for another one.