• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2003년도 Proceeding
• /
• 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 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.

• 대한산업공학회지
• /
• 제20권3호
• /
• pp.139-149
• /
• 1994

For general open queueing network models, the relationship between weak limits of queue lengths and waiting times at stations is investigated under heavy traffic situations. It is shown that under suitable normalization, weak convergence of queue lengths and arrival processes is a sufficient condition for that of waiting times, and is also necessary condition when the network is of feedforward type. Moreover, these weak limits for queue lengths and waiting times are shown to be simply related.

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

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.1129-1132
• /
• 2005

Based on a discrete-time version of the distributional Little's law, we present a simple computational procedure to obtain the queue-length distribution of the discrete-time GI/G/1 queue from its waiting-time distribution that is available by various existing methods. We also discuss our numerical experience and address a couple of remarks on possible extensions of the procedure.

• Journal of the Korean Statistical Society
• /
• 제24권1호
• /
• pp.19-29
• /
• 1995

In this paper, we investigate the asymptotic distributions of maximum queue length for M/G/1 and GI/M/1 systems which are positive recurrent. It is well knwon that for any positive recurrent queueing systems, the distributions of their maxima linearly normalized do not have non-degenerate limits. We show, however, that by concerning an array of queueing processes limiting behaviors of these maximum queue lengths can be established under certain conditions.

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.275-282
• /
• 2010

This paper analyzes a discrete-time bulk-service queue with probabilistic bulk size, where the service process is interrupted by a Markov chain. We study the joint probability generating function of system occupancy and the state of the Markov chain. We derive several performance measures of interest, including average system occupancy and delay distribution.

• 한국경영과학회지
• /
• 제22권2호
• /
• pp.1-12
• /
• 1997

We consider an M/M/2 queue with two servers placed in series. System performance measures that we present in closed expressions are the first and the second moments for the system size, the queue walting time and the sojourn time. We also present an algorithm for computing the queue waiting time distribution function based on the randomization method. As an application, we analyze the double tollbooth system and compare its performance with the conventional single tollbooth system's.

• 대한수학회보
• /
• 제43권2호
• /
• pp.277-292
• /
• 2006

We consider a single-server queue with service time distribution of phase type where positive customers, negative customers and disasters arrive according to a Markovian arrival process with marked transitions (MMAP). We derive simple formulae for the stationary queue length distributions. The Laplace-Stieltjes transforms (LST's) of the sojourn time distributions under the combinations of removal policies and service disciplines are also obtained by using the absorption time distribution of a Markov chain.

• 대한수학회논문집
• /
• 제14권3호
• /
• pp.611-625
• /
• 1999

We consider ΜΑΡ/G/ 1 finite capacity queue with mul-tiple thresholds on buffer. The arrival of customers follows a Markov-ian arrival process(MAP). The service time of a customer depends on the queue length at service initiation of the customer. By using the embeded Markov chain method and the supplementary variable method, we obtain the queue length distribution ar departure epochs and at arbitrary epochs. This gives the loss probability and the mean waiting time by Little's law. We also give a simple numerical examples to apply the overload control in packetized networks.