Transient Solution of an M/M/1 Retrial Queue with Reneging from Orbit

In this paper, the transient behavior of an M/M/1 retrial queueing model is analyzed where the customers in the orbit possess the reneging behavior. There is no waiting room in the system for the arrivals. If the server is not free when the occurrence of an arrival, the arriving customer moves to the waiting group, known as orbit and retries for his service. If the server is idle when an arrival occurs (either coming from outside the queueing system or from the waiting group), the arrival immediately gets the service and leaves the system. Each individual customer in the orbit, retrying for his service, becomes impatient and starts reneging from the orbit. Here the reneging of customers is due to the long wait in the orbit. Using continued fractions, the transient probabilities of orbit size for this model are derived explicitly. Average and variance of orbit size at time t are also obtained. Further, numerical illustrations of performance measures are done to analyze the effect of parameters

(R1971) Analysis of Feedback Queueing Model with Differentiated Vacations under Classical Retrial Policy

This paper analyzes an M/M/1 retrial queue under differentiated vacations and Bernoulli feedback policy. On receiving the service, if the customer is not satisfied, then he may join the retrial group again with some probability and demand for service or may leave the system with the complementary probability. Using the probability generating functions technique, the steady-state solutions of the system are obtained. Furthermore, we have obtained some of the important performance measures such as expected orbit length, expected length of the system, sojourn times and probability of server being in different states. Using MATLAB software, we have represented the graphical interpretation of the results obtained. Finally, the cost is optimized using the parabolic method

Analysis of M[X1],M[X2]/G1,G2/1 retrial queueing system with priority services, working breakdown, collision, Bernoulli vacation, immediate feedback, starting failure and repair

This paper considers an M[X1] , M[X2] /G1,G2/1 general retrial queueing system with priority services. Two types of customers from different classes arrive at the system in different independent compound Poisson processes. The server follows the non-pre-emptive priority rule subject to working breakdown, Bernoulli vacation, starting failure, immediate feedback, collision and repair. After completing each service, the server may go for a vacation or remain idle in the system. The priority customers who find the server busy are queued in the system. If a low-priority customer finds the server busy, he is routed to orbit that attempts to get the service. The system may become defective at any point of time while in operation. However, when the system becomes defective, instead of stopping service completely, the service is continued to the interrupted customer only at a slower rate. Using the supplementary variable technique, the joint distribution of the server state and the number of customers in the queue are derived. Finally, some performance measures are obtained

An M/G/1 Retrial Queue with Single Working Vacation

We consider an M=G=1 retrial queue with general retrial times and single working vacation. During the working vacation period, customers can be served at a lower rate. Both service times in a vacation period and in a service period are generally distributed random variables. Using supplementary variable method we obtain the probability generating function for the number of customers and the average number of customers in the orbit. Furthermore, we carry out the waiting time distribution and some special cases of interest are discussed. Finally, some numerical results are presented

(R1984) Analysis of M^[X1], M^[X2]/G1, G_2^(a,b)/1 Queue with Priority Services, Server Breakdown, Repair, Modified Bernoulli Vacation, Immediate Feedback

In this investigation, the steady state analysis of two individualistic batch arrival queues with immediate feedback, modified Bernoulli vacation and server breakdown are introduced. Two different categories of customers like priority and ordinary are to be considered. This model propose nonpreemptive priority discipline. Ordinary and priority customers arrive as per Poisson processes. The server consistently afford single service for priority customers and the general bulk service for the ordinary customers and the service follows general distribution. The ordinary customers to be served only if the batch size should be greater than or equal to a , else the server should not start service until a customers have accumulated. Meanwhile priority queue is empty; the server becomes idle or go for vacation. If server gets breakdown while the priority customers are being served, they may wait in the head of the queue and get fresh service after repair completion, but in case of ordinary customers they may leave the system. After completion of each priority service, customer may rejoin the system as a feedback customer for receiving regular service because of inappropriate quality of service. Supplementary variable technique and probability generating function are generally used to solve the Laplace transforms of time-dependent probabilities of system states. Finally, some performance measures are evaluated and express the numerical results

On impatience in M/M/1/N/DWV queue with vacation interruption

In this paper, we establish a cost optimization analysis for an M/M/1/N queuing system with differentiated working vacations, Bernoulli schedule vacation interruption, balking and reneging. Once the system is empty, the server waits a random amount of time before he goes on working vacation during which service is provided with a lower rate. At the instant of the service achievement in the vacation period, if there are customers present in the system, the vacation is interrupted and the server returns to the regular busy period with probability β\u27 or continues the working vacation with probability 1 - β\u27. Whenever the working vacation is ended, the server comes back to the normal busy period. If the system is empty, the server can take another working vacation of shorter duration. In addition, it is supposed that during both busy and working vacation periods, arriving customers may become impatient with individual timers exponentially distributed. Explicit expressions for the steady-state system size probabilities are derived using recursive technique. Further, interesting performance measures are explicitly obtained. Then, we construct a cost model in order to determine the optimal values of service rates, simultaneously, to minimize the total expected cost per unit time by using a quadratic fit search method (QFSM). Finally, numerical illustrations are added to validate the theoretical results

AN M[X]/G/1M^{[X]}/G/1 QUEUE WITH OPTIONAL SERVICE AND WORKING BREAKDOWN

In this study, a batch arrival single service queue with two stages of service (second stage is optional) and working breakdown is investigated. When the system is in operation, it may breakdown at any time. During breakdown period, instead of terminating the service totally, it continues at a slower rate. We find the time-dependent probability generating functions in terms of their Laplace transforms and derive explicitly the corresponding steady state results. Furthermore, numerous measures indicating system performances, such as the average queue size and the average queue waiting time, has been obtained. Some of the numerical results and graphical representations were also presented