_{1}

^{*}

Present paper deals a M/M/1:(∞; GD) queueing model with interdependent controllable arrival and service rates where - in customers arrive in the system according to p oisson distribution with two different arrivals rates-slower and faster as per controllable arrival policy. Keeping in view the general trend of interdependent arrival and service processes, it is presumed that random variables of arrival and service processes follow a bivariate p oisson distribution and the server provides his services under general discipline of service rule in an infinitely large waiting space. In this paper, our cen tral attention is to explore the probability generating functions using Rouche’s theorem in both cases of slower and faster arrival rates of the queueing model taken into consideration; which may be helpful for mathematicians and re searchers for establishing significant performance measures of the model. Moreover, for the purpose of high-lighting the application aspect of our investigated result, very recently Maurya [1] has derived successfully the expected busy periods of the server in both cases of slower and faster arrival rates, which have also been presented by the end of this paper.

The probability generating function approach plays a vital role in the study of queueing problems as it is crucially useful in performance analysis of a wide range of queueing models. As an example, the probability generating function approach facilitates to determine the expected busy and idle periods and system size distribution. In the queueing literature, it has been enthusiastically observed that most of the previous researchers [2-7] and references therein have presumed that the parameters of arrival and service rates in the queueing systems are independent to each other. However, it is not so in general because we find many queueing situations in our real life where the arrival and service rates are correlated with an elevated extent. We remark here that the arrival rate of a variety of queueing systems is usually controlled in order to reduce the queue length. Queueing models with controllable arrival rates have been studied by a few noteworthy researchers [3,8-10] which reveals the fact that there is still an increasing demand of analyzing an interdependent queueing models with controllable arrival rates. Srinivasa Rao et al. [

interdependent queueing model with controllable arrival rates under steady state conditions. Of late, Pal [

In the present study, we consider an interdependent queueing model with bivariate Poisson process and controllable arrival rates. The arrival pattern of customers are controlled by the system that it allows two arrival rates and;. Without loss of generality we assume that whenever the system size attains a fixed number S, the arrival rate reduces to from and the arrival rate remains unchanged till the system size is greater than. But as soon as the system size reduces to R, the arrival rate changes back to and the same pattern of change of arrival rates is repeated during the complete busy period of the system. Moreover, we assume that both and representing respectively the arrival and service processes are interdependent and these discrete random variables follow a bivariate Poisson distribution [

with following feasible conditions:

and.

Here is the mean service rate and is the covariance between arrival and service processes.

In addition to our assumptions in previous section-2 of the model, we have here underlying postulates for the purpose of our current study and analysis:

Postulate 3.1: The probability that there is one arrival and no service completion during a small interval of time is; when the system has arrival rate.

Postulate 3.2: The probability that there is neither arrival and nor service completion during a small interval of time is, when the system has arrival rate.

Postulate 3.3: The probability that there is no arrival and one service completion during a small interval of time is, whatever be the arrival rate.

Postulate 3.4: The probability that there is one arrival and one service completion during a small interval of time is; whatever be the arrival rate.

Before proceeding further, we use symbol be the probability that there are n customers in the system at time when system allows the arrival rate.

Now it is fairly easy to observe that exists when however both and exist when; but only exists when

We further assume that the initial system size is 1 and R + 1 respectively when system has arrival rate. Let and be the busy period density respectively when the system has arrival rate.

Now in view of an absorbing barrier at empty system during its faster arrival rate the governing differential difference equations of the system size for the model are as following:

The differential difference equation for the system size is as following:

Moreover, the differential difference equations for the system size are as following:

And the differential difference equation governing the state is as follows

Similarly, in view of an absorbing barrier at system size during its slower arrival rate, we have the differential difference equations governing for the system size as following:

As in the earlier case of faster arrival rate, it is fairly easy to obtain the differential difference equations governing the states for in slower arrival rate of the model which are given as following

Moreover, the differential difference equations governing the states of the system for. in slower arrival rate are as follows

We define following probability generating function for the busy period of server in faster arrival rate: ^{}

and we use symbol^{ }for the Laplace transform ofin following equation:

Multiplying by for in respective differential difference Equations (4.1) to (4.6) and then summing over k and simplifying we obtain following partial differential equation

Taking Laplace transform of both sides of partial differential difference Equation (5.3), it is fairly easy to obtain

As we know the fact that theconverges in the region of the unit circle; and whenever the denominator of RHS of equation (5.4) has zeros in the unit circle;.

The two zeros of the denominators are as following:

From Equation (5.5), we can observe here that

Moreover, we have

On making use of Rouche’s theorem in Equation (5.4), it is fairly easy to evaluate as following:

In view of Equation (5.8), from^{ }Equation (5.5) yields as following:

Equation (5.9) can be used in view of Gross and Harris [

In this section, we define following probability generating function for the busy period of slower arrival rate:

and we use symbol ^{ }^{ }for the Laplace transform of in following equation:

Multiplying through differential difference Equations (4.7) to (4.11) by appropriate power of for and then summing over k and proceeding as in earlier case of faster arrival rate, it is fairly easy to obtain as following:

where is given by following equation:

It is remarkable that in Equation (6.4) possesses following three properties:

Applying Rouche’s theorem in Equation (6.3), we may have as following:

We remark here that using equation (6.8) in the light of Gross and Harris [

The probability generating function is the most important mathematical technique to examine the transient and steady state behavior of queueing models, particularly to explore many significant performance measures in study of wide range of queueing models which has been been evidenced by recent work of Maurya [1,6,7] and references therein and therefore it plays considerably a vital role in analyzing queueing problems. In the present paper, we have successfully investigated the probability generating functions for two different cases of slower and faster arrival rates of an interdependent queueing model with controllable arrival rates taking into account that the two parameters of arrival and service rates follow the bivariate Poisson process. In order to emphasize the application aspect of the investigated result in the present paper, it is much relevant to remark here that by using the probability generating function approach, recently Maurya [