Mathematical Problems in Engineering

Volume 2013 (2013), Article ID 241241, 9 pages

http://dx.doi.org/10.1155/2013/241241

## Control of Traffic Intensity in Hyperexponential and Mixed Erlang Queueing Systems with a Method Based on SPRT

^{1}Department of Statistics, Amasya University, 05000 Amasya, Turkey^{2}Department of Statistics, Ondokuz Mayıs University, 55139 Samsun, Turkey

Received 6 December 2012; Revised 30 May 2013; Accepted 10 June 2013

Academic Editor: Wuquan Li

Copyright © 2013 Müjgan Zobu and Vedat Sağlam. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

The control of traffic intensity is one of the important problems in the study of queueing systems. Rao et al. (1984) developed a method to detect changes in the traffic intensity in queueing systems of the and types based on the Sequential Probability Ratio Test (SPRT). In this paper, SPRT is theoretically investigated for two different phase-type queueing systems which consist of hyperexponential and mixed Erlang. Also, for testing against , Operating Characteristic (OC) and Average Sample Number (ASN) functions are obtained with numerical methods using multipoint derivative equations according to different situations of and type errors. Afterward, numerical illustrations for each model are provided with Matlab programming.

#### 1. Introduction

There are very few studies on the sequential detection of parameter changes of queueing systems in the literature. The theory of SPRT for a sequence of observations forming a finite Markov chain was given in [1]. After, based upon the theory of [1] was discussed statistical quality control and SPRT procedures for the control of traffic intensity in [2–6]. This method aims to detect changes in traffic intensity by observing only the number of customers in the system at successive departure epochs , which are embedded Markov points. Recently, a SPRT to regulate the traffic intensity based on the number of arrivals during the th service periods for queue was proposed in [7] and an autoregressive process based on the number of customers at the departure point and its application to the queueing model were given in [8]. In this paper, the method based on the SPRT is first examined theoretically for the two different queueing phase types. Afterward, the observations obtained for different samples model are evaluated for each of the models by simulation through MATLAB 7.10.0 (R2010a) programming.

#### 2. Queueing Process and SPRT

In many queueing applications, a performance characteristic of great importance and interest is the traffic intensity (the ratio of mean arrival rate to mean service rate ). The purpose of this test is to determine as quickly as possible the changes in traffic intensity and to take the appropriate corrective actions. With this objective, a procedure has been developed for testing the hypothesis against using Wald’s SPRT for the systems and , in which queue length processes have imbedded Markov chains in [6]. This procedure is explained as follows.

Consider the single server queue where arrivals occur according to a Poisson process with rate per unit time. The service times of customers are independent identically distributed (i.i.d.) random variables with the distribution . For this system, the queue lengths at service completion points form an imbedded Markov chain. will be the number of customers left behind by the th departing customer. The capacity of the queueing system is restricted to . Then the transition probability matrix of the imbedded Markov chain is given by where .

Let be the set of time points at which the process exhibits the Markov property; namely,

In the queue, is the time of service completion of the th customer and, in the case of the queue, is the arrival epoch of the th customer. In the case of the queue, though the process is in Markovian continuous time, for purposes of control it is easier to examine the process at arrival points.

For simplicity, we will use the notation . Denoted by the transition probability matrix of the Markov chain defined over state space , where

It is assumed that is known except for the value of the parameter . The problem is to test the hypothesis against .

Consider the sequence of observations . The joint probability of observing this sequence under and is given by

Then the likelihood ratio is

Let and , where and are the probabilities of the errors of the first and second types. Then, Wald’s SPRT [9] to test against becomes as follows.

Observe () successively and at stage , (1)accept if ; (2)accept if ;(3)continue by observing if .

If we assume is specified and denote by the number of transitions up to and including the th transition, then the likelihood ratio given in (5) reduces to

Then the SPRT for testing the hypothesis against will have its continuation region In the case of , , and queues, we will show in the sequel that the logarithm of the likelihood ratio can be written in the form where , , and are constants depending upon the parameters , , and the transition probabilities . Thus (9) reduces to From this it follows that the continuation region of the test is bounded by straight lines ve .

#### 3. Operating Characteristic and Average Sample Number

Approximate formulas for the OC and ASN functions are given in [1]. In order to evaluate the OC and ASN functions, is determined as the largest real positive latent root of the matrix its derivate at and the nonzero root of the equation .

A numerical search technique was employed to find the root in [10]. For evaluating the derivate of at , the following five-point numerical differentiation formula has been used:

When the stated space of is finite, the OC function for the SPRT can be obtained as where is the nonzero real root of the equation . The ASN can then be obtained as

#### 4. SPRT for Phase-Type Distribution

The exponential distribution is very widely used in performance modelling. The reason, of course, is that mathematical tractability flows from the memoryless property of this distribution. But sometimes mathematical tractability is not sufficient to overcome the need for a model process in which the exponential distribution is simply not adequate. This leads us to explore ways in which we can develop more general distributions while maintaining some of the tractability of the exponential. This is precisely what phase-type distributions permit us to do [11].

##### 4.1. Hyperexponential-2 Service Model: The Queue

Consider the configuration presented in Figure 1, in which is the probability that the upper phase is taken and the probability that the lower phase is taken. If such a distribution is used to model a service facility, then a customer entering a service will, with probability , receive the service that is exponentially distributed with parameter and then exit the server or else with probability receive the service that is exponentially distributed with parameter and then exit the server. Once again, only one customer can be in the process of receiving service at any one time; that is, both phases cannot be active at the same time [11].

Theorem 1. *The density function of the service time is given by
**
In this case, one has
**
where .*

*Proof. *Consider
Here
With these values for , the logarithm of the likelihood ratio will be
where

##### 4.2. Mixed Erlang- Service Model: The Queue

This is illustrated in Figure 2, where, with probability , the top series of exponential phases is taken and, with probability , the bottom series of phases is taken.

Theorem 2. *The density function of the service time is given by
**
where is an integer.**In this case, one has
**
where .*

*Proof. *Consider
If the numerator and denominator are divided by ,
and cobrackets are taken as follows:
Here
With these values for , the logarithm of the likelihood ratio will be
where
Here

#### 5. Numerical Results

Consider a queue (with poisson arrivals, two-phase-type exponential service, fixed ).

Let and be the probability for the upper phase and the probability for the lower phase and and the first and second types of errors, respectively. Let be the capacity of the queuing system.

The mean value of is calculated using the following formula:

Suppose that we wish to maintain at the level 0.5 and we wish to detect whether its value has increased. Then, the hypothesis test is against alternative .

Let be a discrete set of the number of customers remaining at points of departure in the queue. The number of customers remaining at the 48-point departure is given as follows:

State space is . Table 1 shows that the number of transitions , and Table 2 shows the value of calculating for SPRT.

From decision region, is between and so that . Therefore, the system is observed again and the number of customers remaining at the 49 points of departure is given as follows:

Table 3 shows that the number of transitions .

From , the decision region, , is small so that . Therefore, the hypothesis is accepted.

For the computation of the OC and ASN of the SPRT, the largest latent root of the matrix has been computed by fixing the values for and . Figure 3 shows the graphs of which have been plotted against the values of for different values of .

As can be seen from Figure 3, there exists one and only one real such that . The derivative of at has been computed. The OC and ASN functions are then evaluated using the expressions between (13) and (17). The results of the OC and ASN functions for testing against are given in Tables 4 and 5 for , and ve , , respectively.

Figures 4 and 5 give the OC curve and the ASN curve for two different error probabilities in the same figure.

In this example, we wish to maintain at the level 0.5 and we wish to detect whether its value has increased. Then, the hypothesis test is against alternative . We accepted hypothesis. There is no need for any change in the system. So traffic intensity is the desired level. If any change in , the queueing system would need to be organized. Namely, if has shifted to from (), the control action could be to increase the mean or add an extra server. If has shifted to from (), the control action could be to decrease the mean or reduce the number of servers.

We can understand from Table 4 that the number of samples required for this hypothesis to be accepted is 82.1395 and the number of samples required for it to be rejected is 122.4006.

As can be understood from the tables and Figures 4 and 5, the smaller the error probability needed, the more the sampling number and power of a test are decreased.

#### 6. Conclusions

The objective of the control technique is to detect changes in the traffic intensity as quickly as possible, then take appropriate corrective action, and determine how much of a sample size is needed in the applications. Thus, the sequential probability ratio test provides a saving of up to fifty percent in the sample size according to traditional methods. At the same time, the use of SPRT is easy for observing only the number of customers in the system at successive departure epochs , which are embedded Markov points.

In this paper, SPRT is theoretically investigated for two different phase-type queueing systems which consist of Hyperexponential and Mixed Erlang. Also the necessary coefficients have been obtained for SPRT.

In the application part, the queue lengths have been generated randomly for different arrival rates , different service rates , and selected system capacities by using MATLAB 7.10.0 (R2010a) programming. Traffic intensities have also been calculated. With the obtained data and predetermined and , a simple hypothesis has been established. Accepting or rejecting the hypothesis has been examined by SPRT. Afterward, the largest latent root of the matrix has been computed by fixing the values for and . Their graphs have been drawn. It has been found that there exists one and only one real such that . The OC and ASN have been calculated with obtained values, and their graphs have been drawn by Microsoft Office Excel 2007 programming.

As a result, the length queue observed at the departure points can be maximum , where , and the length queue observed at the departure points can be minimum , where .

According to the given and , differences in sample size have been observed. It has been observed that when the error probability decreased the sample size grows and the power of test increases. Here, the value of needed to calculate the traffic intensity was taken from the mean (33). If you recall, the purpose of a control technique is to detect changes in the traffic intensity . When has shifted to from the design level (), an appropriate action is taken to bring back to the design level . In the same way, when has shifted to from the design level (), an appropriate action is taken to bring back to the design level . Consequently, the control action could be to increase mean or decrease mean for the phase-type queueing systems.

#### References

- R. M. Phatarfod, “Sequential analysis of dependent observations-I,”
*Biometrika*, vol. 52, pp. 157–165, 1965. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - U. N. Bhat and S. S. Rao, “A statistical technique for the control of traffic intensity in the queuing systems $M/G/1$ and $GI/M/1$,”
*Operations Research*, vol. 20, pp. 955–966, 1972. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - U. N. Bhat, “A statistical technique for the control of traffic intensity in Markovian queue,”
*Annals of Operations Research*, vol. 8, pp. 151–164, 1987. View at Publisher · View at Google Scholar - U. N. Bhat and S. S. Rao, “Statistical analysis of queueing systems,”
*Queueing Systems*, vol. 1, no. 3, pp. 217–247, 1987. View at Publisher · View at Google Scholar · View at MathSciNet - K. Harishchandra and S. S. Rao, “Statistical inference about the traffic intensity parameter of $M/{E}_{k}/1$ and ${E}_{k}/M/1$ queues,” Tech. Rep., Indian Institute of Management, Bangalore, India, 1984. View at Google Scholar
- S. S. Rao, U. N. Bhat, and K. Harishchandra, “Control of traffic intensity in a queue—a method based on SPRT,”
*Opsearch*, vol. 21, no. 2, pp. 63–80, 1984. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. Jain and J. G. C. Templeton, “Problem of statistical inference to control the traffic intensity,”
*Sequential Analysis*, vol. 8, no. 2, pp. 135–146, 1989. View at Google Scholar · View at MathSciNet - S. Jain, “An autoregressive process and its application to queueing mode,”
*Metron-International Journal of Statistics*, vol. 58, no. 1-2, pp. 131–138, 2000. View at Google Scholar - A. Wald,
*Sequential Analysis*, Dover, New York, NY, USA, 2004. View at MathSciNet - S. S. Rao, U. N. Bhat, and K. Harishchanra, “OC and ASN of the SPRT for a finite markov chain and an application to the control of queues,” Tech. Rep. 3, Indian Institute of Management, Bangalore, India, 1980. View at Google Scholar
- W. J. Stewart,
*Probability, Markov Chains, Queues, and Simulation*, Princeton University Press, Princeton, NJ, USA, 2009. View at MathSciNet