This work introduces the join shortest queue policy in retrial setting. We consider a Markovian single server system with two infinite capacity orbits. An arriving job finding busy, it is forwarded to least loaded orbit. Otherwise, an orbit randomly. Orbiting jobs of either type retry access independently. investigate stability condition, stationary tail decay rate, and obtain equilibrium distr...

In this paper we consider a large deviations problem for a discrete-time polling system consisting of two-parallel queues and a single server. The arrival process of each queue is a superposition of traffic streams generated by a number of mutually independent and identical Markovian on/off sources, and the single server serves the two queues according to the so-called Bernoulli service schedul...

We consider the Gt/Mt/st + GIt many-server fluid queue with time-varying parameters, intended as an approximation for the corresponding stochastic queueing model, having general arrival process (the Gt), Markovian service (the Mt) and customer abandonment with mutually independent times to abandon with a general distribution (the +GIt) when there are many servers (the st) and the system experie...

We consider a single server, finite capacity Markovian feedback queue with reneging and retention of reneged customers in which the interarrival and service times follow exponential distribution. The reneging times are assumed to be exponentially distributed. Feedback in queueing literature represents customer dissatisfaction because of inappropriate quality of service. In case of feedback, aft...

This paper deals with a Markovian queueing system having a multi-task service counters and finite queue in front of each counter. The total service of a customer is completed in three stages provided by two servers at three counters. The first server (S1) can serve the counter I and III alternatively, whereas second server (S2) provides the service at counter II. The server (S1) g ives the prio...

In many real life queueing systems, customer balk from the queue but the environment is aware of it only at their times to be served. Naturally, the balking is an outcome of the queue length, and the decision is based on a threshold. Yet, the inspected queue length contains customers who balked In this work, we consider a Markovian queue with infinite capacity with homogeneous customers with re...

This article presents the analysis of a finite buffer M/M/1 queue with multiple and single working vacations. The arriving customers balk (that is do not join the queue) with a probability and renege (that is leave the queue after joining) according to exponential distribution. The inter-arrival times, service times during a regular service period, service times during a vacation period and vac...