• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.749-757
• /
• 2012

We consider the M/PH,G/1 queue with two classes of customers in which class-1 customers have deterministic impatience time and have preemptive priority over class-2 customers who are assumed to be infinitely patient. The service times of class-1 and class-2 customers have a phase-type distribution and a general distribution, respectively. We obtain performance measures of class-2 customers such as the queue length distribution, the waiting time distribution and the sojourn time distribution, by analyzing the busy period of class-1 customers. We also compute the moments of the queue length and the waiting and sojourn times.

• Journal of the Korean Statistical Society
• /
• v.30 no.4
• /
• pp.661-666
• /
• 2001

In this paper we consider an M/G/1 queue where the server of the system has a vacation time and the service policy is limited-1. In this system, upon termination of a vacation the server returns to the queue and serves at most one message in the queue before taking another vacation. We consider two models. In the first, if the sever finds the queue empty at the end of a cacation, then the sever immediately takes another vacation. In the second model, if no message have arrived during a vacation, the sever waits for the first arrival to serve. The analysis of this system is particularly useful for a priority class polling system. We derive Laplace-Stieltjes transforms of the waiting time for both models, and compare their mean waiting times.

• Journal of the Korean Statistical Society
• /
• v.31 no.4
• /
• pp.491-507
• /
• 2002

We analyze a single server bulk input queue with optional server vacations under a single vacation policy and balking phenomenon. The service times of the customers as well as the vacation times of the server have been assumed to be arbitrary (general). We further assume that not all arriving batches join the system during server's vacation periods. The supplementary variable technique is employed to obtain time-dependent probability generating functions of the queue size as well as the system size in terms of their Laplace transforms. For the steady state, we obtain probability generating functions of the queue size as well as the system size, the expected number of customers and the expected waiting time of the customers in the queue as well as the system, all in explicit and closed forms. Some special cases are discussed and some known results have been derived.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.236-242
• /
• 2003

ATM ABR service controls network traffic using feedback information on the network congestion situation in order to guarantee the demanded service qualities and the available cell rates. In this paper we apply the control method using queue length prediction to the formation of feedback information for more efficient ABR traffic control. If backward node receive the longer delayed feedback information on the impending congestion, the switch can be already congested from the uncontrolled arriving traffic and the fluctuation of queue length can be inefficiently high in the continuing time intervals. The feedback control method proposed in this paper predicts the queue length in the switch using the slope of queue length prediction function and queue length changes in time-series. The predicted congestion information is backward to the node. NLMS and neural network are used as the predictive control functions, and they are compared from performance on the queue length prediction. Simulation results show the efficiency of the proposed method compared to the feedback control method without the prediction. Therefore, we conclude that the efficient congestion and stability of the queue length controls are possible using the prediction scheme that can resolve the problems caused from the longer delays of the feedback information.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.3
• /
• pp.1-9
• /
• 2006

The handoff in IEEE 802.11 WLAN is a hard handoff. In hard handoff, a station has to stop the communication. As a result, the station is likely to miss some packets that arrival during the handoff process. To recover these lost packets, buffer-and-forward scheme is used. But, buffer-and-forward scheme is not efficient for real time service. In this paper, we propose new handoff scheme for real time service in home network based WLAN. The scheme uses priority queue which is recommended in IEEE 802.lie, and priority of priority queue is given to real time handoff calls. The simulation results show that the proposed scheme reduces traffic loss and transmission sequence error.

• Proceedings of the Korean Statistical Society Conference
• /
• 2004.11a
• /
• pp.295-300
• /
• 2004

We consider a G/M/1 queue with two-stage service policy. The server starts to serve with rate of ${\mu}1$ customers per unit time until the number of customers in the system reaches A. At this moment, the service rate is changed to that of ${\mu}2$ customers per unit time and this rate continues until the system is empty. We obtain the stationary distribution of the number of customers in the system.

• Journal of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.807-842
• /
• 2001

This paper summarizes recent development of analytical and algorithmical results for stationary FIFO queues with multiple Markovian arrival streams, where service time distributions are general and they may differ for different arrival streams. While this kind of queues naturally arises in considering queues with a superposition of independent phase-type arrivals, the conventional approach based on the queue length dynamics (i.e., M/G/1 pradigm) is not applicable to this kind of queues. On the contrary, the workload process has a Markovian property, so that it is analytically tractable. This paper first reviews the results for the stationary distributions of the amount of work-in-system, actual waiting time and sojourn time, all of which were obtained in the last six years by the author. Further this paper shows an alternative approach, recently developed by the author, to analyze the joint queue length distribution based on the waiting time distribution. An emphasis is placed on how to construct a numerically feasible recursion to compute the stationary queue length mass function.

• Communications of the Korean Mathematical Society
• /
• v.28 no.2
• /
• pp.383-396
• /
• 2013

We consider an M/PH/1 queue with deterministic impatience time. An exact analytical expression for the stationary distribution of the workload is derived. By modifying the workload process and using Markovian structure of the phase-type distribution for service times, we are able to construct a new Markov process. The stationary distribution of the new Markov process allows us to find the stationary distribution of the workload. By using the stationary distribution of the workload, we obtain performance measures such as the loss probability, the waiting time distribution and the queue size distribution.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.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).

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.377-385
• /
• 1996

We present an approximate algorithmic approach for the m-server fork-join queueing system with infinite queue capacity. We analyze the system size and queue waiting time. We assume Poisson arrival process and independent exponential service times.