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

This paper aims to present an approach for modeling and analyzing an M/G/1//2 retrial queue, using the MRSPN ( Markov Regenerative Stochastic Petri Nets ) tool. The consideration of the retrials and finite source population introduce analytical di culties. The expressive power of the MRSPN formalism provides us with a detailed modeling of retrial systems. In addition to this modeling, this form...

This paper studies a discrete-time queueing system in which customer who enters the with server occupied may choose to go retrial group or begin its service displacing that was server. If is idle arriving begins immediately. Retrial and times are general, only repeated can directly one situated at first place of group. A complete study model has been curried out noting specially analysis recurs...

We consider a GI/G/c/K-type retrial queueing system with constant retrial rate. The system consists of a primary queue and an orbit queue. The primary queue has c identical servers and can accommodate the maximal number of K jobs. If a newly arriving job finds the full primary queue, it joins the orbit. The original primary jobs arrive to the system according to a renewal process. The jobs have...

In many service settings, customers have to join the queue without being fully aware of the parameters of the service provider (for e.g., customers at check-out counters may not know the true service rate prior to joining). In such "blind queues'', customers typically make their decisions based on the limited information about the service provider's operational parameters from past experiences,...

In the literature, retrial queues with batch arrivals and heavy-tailed service times have been studied so-called equivalence theorem has established under condition that time is heavier than size. The provides distribution (or tail) between total number of customers in system for queue corresponding standard (non-retrial) queue. this paper, assumption regularly varying tails, we eliminate by al...

Abstract: This paper deals with the steady state behavior of an M/G/1 retrial queue with two successive phases of service and general retrial times under Bernoulli vacation schedule for an unreliable server. While the server is working with any phase of service, it may breakdown at any instant and the service channel will fail for a short interval of time. The primary customers finding the serv...