• IE interfaces
• /
• v.13 no.4
• /
• pp.738-744
• /
• 2000

This Paper presents a method for unfinished work transition probability distribution of modulated $n^*D/D/l$ queue with overload period. The Modulated $n^*D/D/l$ queue is well known as a performance analysis model of ATM multiplexer with superposition of homogeneous periodic on-off traffic sources. Theory of probability by conditioning and results of $N^*D/D/l$ queue are used for analytic methodology. The results from this paper are expected to be applied to general modulated $n^*D/D/l$ queue.

• Communications of the Korean Mathematical Society
• /
• v.10 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.3
• /
• pp.51-63
• /
• 1993

We consider a cyclid server system under N-policy. This system consists of multiple queues served in a cyclic order by a single server. In this paper, we consider the following control policy. Every time server polls one queue, the server inspects the state of the queue. If the total number of units is found to have reached or exceeded a pre-specified value, the server begins to serve the queue until it is empty. As soon as the queue becomes empty, the server polls next queue. An approximate analysis of this system is presented. Sever vacation model is used as an analytical tool. However, server vacation periods are considered to be dependent on the service times of respective queues. The results obtained from the approximate analysis are ompared with simulation results.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.453-460
• /
• 2006

A discrete-time priority queueing system with place reservation discipline is studied, in which two different types of packets arrive according to batch geometric streams. It is assumed that there is a reserved place in the queue. Whenever a high-priority packet enters the queue, it will seize the reserved place and make a new reservation at the end of the queue. Low-priority arrivals take place at the end of the queue in the usual way. Using the probability generating function method, the joint distribution of system state and the delay distribution for each type are obtained.

• Proceedings of the Korean Statistical Society Conference
• /
• 2004.11a
• /
• pp.289-294
• /
• 2004

We consider M/G/1 queue in which the customers are classified into n+1 classes by their impatience time. First, we analyze the model of two types of customers; one is the customer with constant impatience duration k and the other is patient customer. The expected busy period of the server and the limiting distribution of the virtual waiting time process are obtained. Then, the model is generalized to the one in which there are classes of customers according to their impatience duration.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.505-511
• /
• 2007

In this paper, we examine the Markov chain $\{X_k,\;N_k;\;k=0,\;1,...$. We show that the marginal steady state distribution of Xk is discrete phase type. The implication of this result is that the queue length distribution of phase type for large number of examples where this Markov chain is applicable and shows a queueing application by matrix geometric methods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.3
• /
• pp.66-75
• /
• 2017

Priority disciplines are an important scheme for service systems to differentiate their services for different classes of customers. (N, n)-preemptive priority disciplines enable system engineers to fine-tune the performances of different classes of customers arriving to the system. Due to this virtue of controllability, (N, n)-preemptive priority queueing models can be applied to various types of systems in which the service performances of different classes of customers need to be adjusted for a complex objective. In this paper, we extend the existing (N, n)-preemptive resume and (N, n)-preemptive repeat-identical priority queueing models to the (N, n)-preemptive repeat-different priority queueing model. We derive the queue-length distributions in the M/G/1 queueing model with two classes of customers, under the (N, n)-preemptive repeat-different priority discipline. In order to derive the queue-length distributions, we employ an analysis of the effective service time of a low-priority customer, a delay cycle analysis, and a joint transformation method. We then derive the first and second moments of the queue lengths of high- and low-priority customers. We also present a numerical example for the first and second moments of the queue length of high- and low-priority customers. Through doing this, we show that, under the (N, n)-preemptive repeat-different priority discipline, the first and second moments of customers with high priority are bounded by some upper bounds, regardless of the service characteristics of customers with low priority. This property may help system engineers design such service systems that guarantee the mean and variance of delay for primary users under a certain bounds, when preempted services have to be restarted with another service time resampled from the same service time 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 applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.389-405
• /
• 2007

In this paper, we study a k-out-of-n system with single server who provides service to external customers also. The system consists of two parts:(i) a main queue consisting of customers (failed components of the k-out-of-n system) and (ii) a pool (of finite capacity M) of external customers together with an orbit for external customers who find the pool full. An external customer who finds the pool full on arrival, joins the orbit with probability ${\gamma}$ and with probability $1-{\gamma}$ leaves the system forever. An orbital customer, who finds the pool full, at an epoch of repeated attempt, returns to orbit with probability ${\delta}\;(<\;1)$ and with probability $1-{\delta}$ leaves the system forever. We compute the steady state system size probability. Several performance measures are computed, numerical illustrations are provided.

• Journal of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.211-236
• /
• 1995

The purpose of this paper is to provide a transient diffusion approximation of queue size distribution for M/G/m/N system. The M/G/m/N system can be expressed as follows. The interarrival times of customers are exponential and the service times of customers have general distribution. The system can hold at most a total of N customers (including the customers in service) and any further arriving customers will be refused entry to the system and will depart immediately without service. The queueing system with finite capacity is more practical model than queueing system with infinite capacity. For example, in the design of a computer system one of the important problems is how much capacity is required for a buffer memory. It its capacity is too little, then overflow of customers (jobs) occurs frequently in heavy traffic and the performance of system deteriorates rapidly. On the other hand, if its capacity is too large, then most buffer memories remain unused.