• Communications for Statistical Applications and Methods
• /
• 제20권5호
• /
• pp.377-385
• /
• 2013

We consider a compound Poisson risk model in which the premium rate changes when the surplus exceeds a threshold. The explicit form of the ruin probability for the risk model is obtained by deriving and using the overflow probability of the workload process in the corresponding M/G/1 queueing model.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2000년도 추계학술대회 및 정기총회
• /
• pp.59-62
• /
• 2000

Many of the previous researchers have been studied for the performance estimation of an AS/RS with a static model or computer simulation. Especially, they assumes that the storage/retrieval (S/R) machine performs either only single command (SC) or dual command (DC) and their requests are known in advance. However, the S/R machine performs a SC or a DC. or both or becomes idle according to the operating policy and the status of system at an arbitrary point of time. In this paper, we propose a stochastic model for the performance estimation of a unit-load AS/RS by using a M/G/1 queueing model with a single-server and two queues. Expected numbers of waiting storage and retrieval commands, and the waiting time in queues for the storage and retrieval commands are found

• 대한산업공학회지
• /
• 제24권3호
• /
• pp.381-386
• /
• 1998

We frequently encounter stopped random sums when modelling queueing systems. We also notice occasional mishandling of stopped random sums in the literature. The purpose of this note is to prevent further mistakes by identifying and correcting typical mistakes about stopped random sums. As an example model, we use the two-phase M/G/1 queue with multiple vacations.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.841-844
• /
• 2002

Recently there has been an increasing interest in queueing models with disasters. Upon arrival of a disaster, all the customers present are noshed out. Queueing models with disasters have been applied to the problems of failure recovery in many computer networks systems, database systems and telecommunication networks in this paper, we suffest the steady state and sojourn time distributions of the M/G/l model with disaster and mass alway when the system is empty.

• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2000년도 추계학술발표논문집
• /
• pp.561-566
• /
• 2000

컴퓨터 통신 시스템은 단말기와 C.P.U와의 접속 방법에 따라 시분할 시스템과 분산 시스템으로 나누어지는데 이들 두 가지 시스템에서 버퍼에서의 큐잉 형태는 각기 다르다. 본고에서 시분할 시스템의 역 다중화기의 큐잉 형태에 대해서 분석하였고 그것은 결국 M/G/1모델로 나타낼 수 있음을 보여주고 있다.

• 충청수학회지
• /
• 제27권3호
• /
• pp.405-411
• /
• 2014

Queueing systems with retrials are widely used to model many problems in call centers, telecommunication networks, and in daily life. We present a very accurate but simple approximate formula for the distribution of the number of retrying customers in the M/G/1 retrial queue.

• 산업경영시스템학회지
• /
• 제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.

• 대한산업공학회지
• /
• 제27권1호
• /
• pp.11-17
• /
• 2001

We consider the M/G/1 with Bernoulli feedback, where the served customers wait in the feedback queue for rework with probability p. It is important to decide the moment of dispatching in feedback systems because of the dispatching cost for rework. Up to date, researches have analyzed for the instantaneous-dispatching model or the case that dispatching epoch is determined by the state of feedback queue. In this paper we deal with a dispatching model whose dispatching epoch depends on main queue. We adopt supplementary variable method for our model and a numerical example is given for clarity.

• 사물인터넷융복합논문지
• /
• 제9권3호
• /
• pp.1-6
• /
• 2023

웹 서비스 환경에서 사용자가 원하는 서비스 품질을 만족하는 경제적인 방법의 하나는 객체의 크기를 조절하는 것이다. 이를 위해 본 연구에서는 서비스 품질로 평균 응답 시간이 임의의 임계값 이하로 주어질 때, 이 제약 조건을 만족하는 최대 객체의 크기를 구한다. 시스템이 정상 상태일 때, 라운드-로빈을 사용하는 결정 모델의 평균 응답 시간은 일반 분포를 따르는 큐잉 모델에서의 평균 응답 시간과 같아질 것으로 추론할 수 있다. 이를 기반으로 최대 객체 크기를 발견하기 위한 해석적 수식과 절차를 수립한다. 웹 트래픽은 서비스 분포로 Pareto 분포가 적합하므로 M/G(Pareto)/1 모델과 지수 분포를 사용한 M/G/1/PS를 적용하여 최대 객체의 크기를 구한다. 수치 계산을 통한 성능평가는 Pareto 분포의 형상 파라미터(shaping parameter)가 커짐에 따라 M/G(Pareto)/1 모델과 M/G/1/PS 모델의 최대 객체 크기가 같아짐을 보여준다. 본 연구의 결과는 경제적인 웹 서비스 제어를 위해 객체의 크기를 조절하는 환경에 사용될 수 있다.

• 대한산업공학회지
• /
• 제26권2호
• /
• pp.81-87
• /
• 2000

As for M/G/1 queueing system, we use various control policies, with which we can optimize the system. Up to now the most widely adopted policies are N-Policy, T-Policy, D-Policy, and so on. The existing researches are largely concerned to find an optimal operation condition or to optimize the system under single policy in M/G/1 system. There are, however, few literatures dealing with multiple control policies at once to enhance the flexibility of the model. In this study, we consider M/G/1 system adopting N-Policy and T-Policy simultaneously. If one of two conditions is satisfied, then, the server starts the service. We call this Min(N,T)-Policy. We find the probability distribution of the number of customers and mean waiting time in steady state and derive a cost function. Next, we seek the $N^*$, optimal threshold under various N values. Finally, we reveal the characteristics of cost function.