• Journal of applied mathematics & informatics
• /
• 제39권1_2호
• /
• pp.173-196
• /
• 2021

This paper treats a retrial queue with phase type retrial times and a threshold type-policy, where each server is subject to breakdowns and repairs. Upon a server failure, the customer whose service gets interrupted will be handed over to another available server, if any; otherwise, the customer may opt to join the retrial orbit or depart from the system according to a Bernoulli trial. We analyze such a multi-server retrial queue using the recently introduced threshold-based retrial times for orbiting customers. Applying the matrix-analytic method, we carry out the steady-state analysis and report a few illustrative numerical examples.

• 응용통계연구
• /
• 제24권2호
• /
• pp.347-357
• /
• 2011

본 논문은 M/$E_n$/1 큐에서 overshoot에 대한 근사식을 제안한다. overshoot은 큐의 작업부하량과정이 어떤 한계점을 처음으로 초과한 순간에 그 초과량을 의미하는데, overshoot의 분포 및 1차, 2차 적률은 큐의 최적화문제를 푸는데 중요한 역할을 한다. 본 논문에서는 그동안 이루어진 overshoot의 분포에 대한 이론적인 결과를 바탕으로 하여 overshoot의 분포를 고객의 서비스시간의 분포와 지수분포의 선형결합으로 표현하는 근사식을 제안한다. 그리고 제안된 근사식의 정확성을 확인하기 위하여 시뮬레이션을 통해 구한 overshoot의 분포와 비교한다.

• Journal of the Korean Statistical Society
• /
• 제36권2호
• /
• pp.285-297
• /
• 2007

We consider the $P_{\lambda}^M-service$ policy for an M/G/1 queueing system in which the workload is monitored randomly at discrete points in time. If the level of the workload exceeds a threshold ${\lambda}$ when it is monitored, then the service rate is increased from 1 to M instantaneously and is kept as M until the workload reaches zero. By using level-crossing arguments, we obtain explicit expressions for the stationary distribution of the workload in the system.

• 대한산업공학회지
• /
• 제35권2호
• /
• pp.171-177
• /
• 2009

This study presents the switching strategy between admission control and pricing control policies and clarifies the properties of the switching strategy in an M/M/1/K queueing system. In addition, this study demonstrates that employing the switching strategy can significantly improve the maximum total expected profit.

• 대한수학회보
• /
• 제47권6호
• /
• pp.1251-1258
• /
• 2010

For an M/G/1 processor-sharing queue with batch arrivals, Avrachenkov et al. [1] conjectured that the conditional mean sojourn time is concave. However, Kim and Kim [5] showed that this conjecture is not true in general. In this paper, we show that this conjecture is true if the service times have a hyperexponential distribution.

• 한국경영과학회지
• /
• 제41권3호
• /
• pp.37-43
• /
• 2016

This note discusses the inter-loss time ofan M/G/1/1 queuing system. The inter-loss time is defined as the time duration between two consecutive losses of arriving customers. In this study, we present the explicit Laplace transform of the inter-loss time distribution of an M/G/1/1 queuing system.

• Journal of applied mathematics & informatics
• /
• 제6권3호
• /
• pp.943-952
• /
• 1999

Models of single-server queues with vacation have been widely used to study the performance of many computer communica-tion and production system. In this paper we use the formula for a wide class of vacation policies and multiple types of vacations based on the M/G/1 queue with generalized vacations and exhaustive service. furthermore we derive the waiting times for many complex vacation policies which would otherwise be to analyze. These new results are also applicable to other related queueing models. if they conform with the basic model considered in this paper.

• Journal of Information Processing Systems
• /
• 제7권4호
• /
• pp.679-690
• /
• 2011

In this paper we consider a local area network (LAN) of dual mode service where one is a token bus and the other is a carrier sense multiple access with a collision detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet dropping probability of a dual mode LAN for finite length queue M/G/1(m) traffic. Here, the offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond delay. The concept of a tabular solution for two-dimensional Poisson's traffic of circuit switching is adapted here to find the cell dropping probability of the dual mode packet service. Although the work is done for the traffic of similar bandwidth, it can be extended for the case of a dissimilar bandwidth of a circuit switched network.

• 대한산업공학회지
• /
• 제6권1호
• /
• pp.1-7
• /
• 1980

An exact solution technique for M/M/s multi-server demanding queue is introduced, and a general form of the curves representing service rates of the system is presented. As the number of customers in the system increases, the service rate is shown to increase initially, then decrease, and finally converge to a certain value. It is also shown that this phenomenon persists regardless of the numbers of servers and customer types.

• 대한수학회논문집
• /
• 제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.