• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2002년도 추계 학술발표회 논문집
• /
• pp.273-277
• /
• 2002

In this paper, with martingale argument we derive the explicit formula for the Laplace transform of the busy period of M/M/1 queue with bounded workload which is also called finite dam. Much simpler derivation than appeared in former literature provided.

• Journal of applied mathematics & informatics
• /
• 제33권3_4호
• /
• pp.343-350
• /
• 2015

We consider an M^X/G/1 retrial queue, where the batch size and service time distributions have finite exponential moments. We show that the tail of the queue size distribution is asymptotically given by a geometric function multiplied by a power function. Our result generalizes the result of Kim et al. (2007) to the M^X/G/1 retrial queue.

• 대한수학회논문집
• /
• 제14권4호
• /
• pp.805-814
• /
• 1999

We consider an MMPP/G/1/K finite queue with two-level threshold overload control. This model has frequently arisen in the design of the integrated communication systems which support a wide range applications having various Quality of Service(QoS) requirements. Through the supplementary variable method, se derive the queue length distribution.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.523-533
• /
• 2006

We analyze two finite buffers queueing system with priority scheduling dependent upon queue length. Customers are classified into two types ( type-l and type-2 ) according to their characteristics. Here, the customers can be considered as traffics such as voice and data in telecommunication networks. In order to support customers with characteristics of burstiness and time-correlation between interarrival, the arrival of the type-2 customer is assumed to be an Markov- modulated Poisson process(MMPP). The service order of customers in each buffer is determined by the queue length of two buffers. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, performance measures such as loss and mean delay are derived.

• 한국경영과학회지
• /
• 제33권1호
• /
• pp.107-115
• /
• 2008

We consider the discrete-time GI/G/1/K queue under the early arrival system. Using a modified supplementary variable technique(SVT), we obtain the distribution of the steady-state queue length. Unlike the conventional SVT, the modified SVT yields transform-free results in such a form that a simple two-moment approximation scheme can be easily established.

• 충청수학회지
• /
• 제25권4호
• /
• pp.747-752
• /
• 2012

When the service time distribution has a finite exponential moment, we present a large deviations result for the busy period distribution in the M/G/1 queue without the assumption of Abate and Whitt (1997) and Kyprianou (1971).

• 대한수학회보
• /
• 제46권4호
• /
• pp.673-689
• /
• 2009

We analyze $MAP_1,\;MAP_2$/G/1 finite queues with service scheduling function dependent upon queue lengths. The customers are classified into two types. The arrivals of customers are assumed to be the Markovian Arrival Processes (MAPs). The service order of customers in each buffer is determined by a service scheduling function dependent upon queue lengths. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, the performance measures such as loss probability and mean waiting time are derived. Some numerical examples also are given with applications in telecommunication networks.

• 대한수학회지
• /
• 제40권1호
• /
• pp.87-107
• /
• 2003

In this paper, we consider a discrete time queueing system fed by a superposition of an ON and OFF source with heavy tail ON periods and geometric OFF periods and a D-BMAP (Discrete Batch Markovian Arrival Process). We study the tail behavior of the queue length distribution and both infinite and finite buffer systems are considered. In the infinite buffer case, we show that the asymptotic tail behavior of the queue length of the system is equivalent to that of the same queueing system with the D-BMAP being replaced by a batch renewal process. In the finite buffer case (of buffer size K), we derive upper and lower bounds of the asymptotic behavior of the loss probability as $K\;\longrightarrow\;\infty$.

• Journal of applied mathematics & informatics
• /
• 제30권3_4호
• /
• pp.531-540
• /
• 2012

An approximation for the number of customers at service facility in $M/G/c/K$ retrial queue is provided with the help of the approximations of ordinary $M/G/c/K$ loss system and ordinary $M/G/c$ queue. The interpolation between two ordinary systems is used for the approximation.

• 대한수학회논문집
• /
• 제10권3호
• /
• pp.715-733
• /
• 1995

We present a transient queue size distribution for $M/G/m/N$ queue with state dependent arrival rates, using the diffusion process with piecewise constant diffusion parameters, with state space [0, N] and elementary return boundaries at x = 0 and x = N. The model considered here contains not only many basic model but the practical models such as as two-node cyclic queue, repairmen model and overload control in communication system with finite storage buffer. For the accuracy check, we compare the approximation results with the exact and simulation results.