• 대한수학회보
• /
• 제42권4호
• /
• pp.875-887
• /
• 2005

In M/G/1 retrial queueing system with two types of customers and feedback, we derived the joint generating function of the number of customers in two groups by using the supplementary variable method. It is shown that our results are consistent with those already known in the literature when ${\delta}_k\;=\;0(k\;=\;1,\;2),\;{\lambda}_1\;=\;0\;or\;{\lambda}_2\;=\;0$.

• 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.

• 대한수학회지
• /
• 제35권3호
• /
• pp.691-712
• /
• 1998

We consider an M$_1$, M$_2$/G/1/ K retrial queueing system with a finite priority queue for type I calls and infinite retrial group for type II calls where blocked type I calls may join the retrial group. These models, for example, can be applied to cellular mobile communication system where handoff calls have higher priority than originating calls. In this paper we apply the supplementary variable method where supplementary variable is the elapsed service time of the call in service. We find the joint generating function of the numbers of calls in the priority queue and the retrial group in closed form and give some performance measures of the system.

• 충청수학회지
• /
• 제24권4호
• /
• pp.687-693
• /
• 2011

This paper gives the stochastic comparison results for the first passage time distributions in the M/G/1 retial queue.

• ETRI Journal
• /
• 제30권3호
• /
• pp.492-494
• /
• 2008

While the retrial phenomenon plays an important role in communication networks and should not be ignored, retrial systems do not present an exact analytic solution, so approximate techniques are required. To the best of our knowledge, all the existing techniques are based on computing the steady states probabilities. We propose another approach based on the relative state values which appear in the Howard equations. The results of the numerical evaluation carried out show that this solution outperforms previous approaches in terms of both accuracy and computation time.

• 한국품질경영학회:학술대회논문집
• /
• 한국품질경영학회 2004년도 품질경영모델을 통한 가치 창출
• /
• pp.499-502
• /
• 2004

Multi-server Markovian retrial model with heterogeneous servers is analyzed. Arriving customers constitute the MMAP(Marked Markovian Arrival Process). Distribution of the primary customers among the servers is performed randomly depending on the type of a customer and the number of the server. Customers from the orbit have the exponential service time distribution with a parameter depending on the server only. The choice of the server for a retrial is made randomly as well. Multidimensional continuous time Markov chain describing operation of the model is investigated by means of reducing to asymptotically quasi-toeplitz Markov chaius.

• Journal of applied mathematics & informatics
• /
• 제26권3_4호
• /
• pp.721-732
• /
• 2008

A single server infinite capacity queueing system with Poisson arrival and a general service time distribution along with repeated attempt and server vacation is considered. We made a comprehensive analysis of the system including ergodicity and limiting behaviour. Some operating characteristics are derived and numerical results are presented to test the feasibility of the queueing model.

• 대한수학회논문집
• /
• 제13권2호
• /
• pp.393-403
• /
• 1998

We consider $M_1,M_2/M/1$ retrial queues with two classes of customers in which the service rates depend on the total number or the customers served since the beginning of the current busy period. In the case that arriving customers are bloced due to the channel being busy, the class 1 customers are queued in the priority group and are served as soon as the channel is free, whereas the class 2 customers enter the retrical group in order to try service again after a random amount of time. For the first $N(N \geq 1)$ exceptional services model which is a special case of our model, we derive the joint generating function of the numbers of customers in the two groups. When N = 1 i.e., the first exceptional service model, we obtain the joint generating function explicitly and if the arrival rate of class 2 customers is 0, we show that the results for our model coincide with known results for the M/M/1 queues with smart machine.

• Journal of Communications and Networks
• /
• 제16권2호
• /
• pp.193-201
• /
• 2014

In cognitive radio networks, the packet transmissions of the secondary users (SUs) can be interrupted randomly by the primary users (PUs). That is to say, the PU packets have preemptive priority over the SU packets. In order to enhance the quality of service (QoS) for the SUs, we propose a spectrum access strategy with an ${\alpha}$-Retry policy. A buffer is deployed for the SU packets. An interrupted SU packet will return to the buffer with probability ${\alpha}$ for later retrial, or leave the system with probability (1-${\alpha}$). For mathematical analysis, we build a preemptive priority queue and model the spectrum access strategy with an ${\alpha}$-Retry policy as a two-dimensional discrete-time Markov chain (DTMC).We give the transition probability matrix of the Markov chain and obtain the steady-state distribution. Accordingly, we derive the formulas for the blocked rate, the forced dropping rate, the throughput and the average delay of the SU packets. With numerical results, we show the influence of the retrial probability for the strategy proposed in this paper on different performance measures. Finally, based on the trade-off between different performance measures, we construct a cost function and optimize the retrial probabilities with respect to different system parameters by employing an iterative algorithm.

• 대한수학회보
• /
• 제53권4호
• /
• pp.985-1004
• /
• 2016

We consider the MAP/PH/c/K queue in which blocked customers retry to get service and servers may take vacations. The time interval between retrials and vacation times are of phase type (PH) distributions. Using the method of mean drift, a sufficient condition of ergodicity is provided. A condition for the system to be unstable is also given by the stochastic comparison method.