<p style='text-indent:20px;'>In this article, we propose a dynamic operating of single server service system between conventional and retrial queues with impatient customers. Necessary sufficient conditions for the stability, an explicit expression joint steady-state probability distribution are obtained. We have derived some interesting important performance measures under consideration....

We reconsider the M/M/∞ queue with two-state Markov modulated arrival and service processes and the singleserver retrial queue analyzed in Keilson and Servi [1]. Fuhrmann and Cooper type stochastic decomposition holds for the stationary occupancy distributions in both queues ([1] and [2]). The main contribution of the present paper is the derivation of the explicit form of the stationary system...

This paper considers a multiserver queueing system with finite capacity. Customers that find the service facility being fully occupied are blocked and enter a virtual waiting room (called orbit). Blocked customers stay in the orbit for an exponentially distributed time and retry to occupy an idle server again. After completing a service, the server starts an additional job that we call an after...

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

Five different classical bulk queueing models with variations are considered from chapter II to chapter VI. This chapter and chapter VIII are devoted for the analysis of two different retrial queueing models. Retrial queueing system is characterized by the feature that the arriving customers, who encounter the server busy, join a virtual pool called orbit. An arbitrary customer in the orbit gen...

The approximate solution technique for the main M/M/c retrial queue based on the homogenization of the model employs a quasi-birth-death (QBD) process in which the maximum retrial rate is restricted above a certain level. This approximated continuous-time Markov chain (CTMC) can be solved by the matrixgeometric method, which involves the computation of the rate matrix R. This paper is motivated...

Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a type-i job (i = 1, 2) finds the server busy, it is blocked and routed to a separate type-i retrial (orbit) queue that attempts to re-dispatch its jobs at its specific Poisson rate. This creates a system with three dependent queues. Such a queueing s...

Data on the Internet is sent by packets that go through a network of routers. A router drops packets either when its buffer is full or when it uses the Active Queue Management. Up to the present, majority of the Internet routers use a simple DropTail strategy. The rate at which a user injects the data into the network is determined by Transmission Control Protocol (TCP). However, most connectio...