• 한국경영과학회지
• /
• 제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.

• Journal of Communications and Networks
• /
• 제17권3호
• /
• pp.265-266
• /
• 2015

In a recent paper [1], the authors investigated the maximum stable throughput region of a network composed of a rechargeable primary user and a secondary user plugged to a reliable power supply. The authors studied the cases of an infinite and a finite energy queue at the primary transmitter. However, the results of the finite case are incorrect. We show that under the proposed energy queue model (a decoupled M/D/1 queueing system with Bernoulli arrivals and the consumption of one energy packet per time slot), the energy queue capacity does not affect the stability region of the network.

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

There are many queueing systems where customers wait for service up to a certain amount of time and leave the system if they are not served during that time. This paper considers a finite capacity multi-server queueing system with Poisson input and Erlang service time, where a customer becomes a lost customer when his service has not begun within an exponential patient time after his arrival. Performance measures such as average queue length, the average number of customers in service, and the proportion of lost customers can be obtained exactly through the proposed numerical solution procedure.

• 대한산업공학회지
• /
• 제33권4호
• /
• pp.419-423
• /
• 2007

In this paper, we consider the M/G/1 queueing system with randomized control of T-policy. Whenever the busy period ends, the server is turned off and takes multiple vacations whose interval is fixed time T with probability p or stays on and waits for arriving customers with probability 1-p. We introduce the cost function and determine the optimal combination of (p, T) to minimize the average cost per unit time.

• Management Science and Financial Engineering
• /
• 제12권2호
• /
• pp.1-18
• /
• 2006

We consider an $M^x/G/1$ queueing system with Bernoulli vacation schedule under multiple vacation policy. where after each vacation completion or service completion the server takes sequence of vacations until a batch of new customer arrive. This generalizes both $M^x/G/1$ queueing system with multiple vacation as well as M/G/1 Bernoulli vacation model. We carryout an extensive analysis for the queue size distributions at various epochs. Further attempts have been made to unify the results of related batch arrival vacation models.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 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.

• 대한산업공학회지
• /
• 제32권4호
• /
• pp.369-372
• /
• 2006

Suppose that a customer arrives at the GI/M/1/K queueing system when there are customers in the system, $n,m{\geq}0,\;n+m{\leq}K$. Sooner or later, the number of customers in the system will reach . In this paper, we present the Laplace transform of the remaining interarrival time upon reaching level, for the first time, since a customer arrived when there are customers in the system.

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

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

• 한국경영과학회지
• /
• 제32권1호
• /
• pp.93-104
• /
• 2007

We consider a supply chain where products are shipped to warehouse from manufacturing system to customers. Products are supplied from either in-house regular manufacturing or the secondary source such as subcontractor. The inventory in warehouse is controlled by base-stock policy, that is, whenever a demand arrives from customer, an order is released to the manufacturing system. Unsatisfied demand is backlogged. The manufacturing system is modeled as M/M/s+1/c queueing system, and the orders exceeding the given limit care blocked and lost. The steady state distribution of the outstanding orders and the throughput of the manufacturing system are functions of the level of engagement In the secondary source. There is a profit obtained from throughput and cost not only due to the engagement of the secondary source in the manufacturing system but also inventory positions. We want to maximize the total production profit minus the total cost of the production system by simultaneously determining the optimal level of engagement of the secondary source and the optimal base-stock level of the inventory. We develop two algorithms : one without guarantee of the optimal solution but with the small number of computations, the other optimal but with more computations.

• 한국통신학회논문지
• /
• 제18권11호
• /
• pp.1785-1796
• /
• 1993

본 연구는 각종 레이다로부터 얻어지는 다양한 정보를 하나의 통합된 시스템으로 처리하는 정보통합 처리시스템의 구성을 제안하였고, 제안된 시스템의 성능과 타당성 분석은 m/m/1큐 모델에 의한 시스템 시뮬레이션을 통하여 평가되었다. 또 이들 정보처리 시스템간의 연동을 위한 종합정보망을 설계하고 그 전송특성을 분석하였다. 정보통합 처리시스템의 설계에서는 정보처리 형태에 따라 단일형과 분산다중형으로 분류하려 구성하였다. 각 시스템의 구조는 실시간 처리 프로세서로서 UNIX의 메시지 큘ㄹ 사용하였으며 이들 모델 시스템의 성능 분석에는 큐잉모델을 사용하여 시스템의 정보흐름을 모델링하고 시뮬레이션을 위한 소프트웨어는 OPNET 시스템 커널과 C언어로써 작성하였다. 작성된 분석 프로세서에 의해 시스템의 지연시간과 메시지 Blocking등의 주요 큐잉요소를 관찰하고 이를 통해 분산다중형과 단일형 양모델간의 특성을 비교 검토하였다.