CALIBRATED CONFIDENCE INTERVALS FOR INTENSITIES OF A TWO STAGE OPEN QUEUEING NETWORK WITH FEEDBACK

GEDAM V.K.1, PATHARE S.B.2*
1Department of Statistics, University of Pune- 411007, MS, India.
2Indira College of Commerce and Science, Pune- 411033, MS, India.
* Corresponding Author : sureshpathare23@gmail.com

Received : 02-08-2013     Accepted : 22-08-2013     Published : 07-09-2013
Volume : 4     Issue : 1       Pages : 151 - 161
J Stat Math 4.1 (2013):151-161

Cite - MLA : GEDAM V.K. and PATHARE S.B. "CALIBRATED CONFIDENCE INTERVALS FOR INTENSITIES OF A TWO STAGE OPEN QUEUEING NETWORK WITH FEEDBACK." Journal of Statistics and Mathematics 4.1 (2013):151-161.

Cite - APA : GEDAM V.K., PATHARE S.B. (2013). CALIBRATED CONFIDENCE INTERVALS FOR INTENSITIES OF A TWO STAGE OPEN QUEUEING NETWORK WITH FEEDBACK. Journal of Statistics and Mathematics, 4 (1), 151-161.

Cite - Chicago : GEDAM V.K. and PATHARE S.B. "CALIBRATED CONFIDENCE INTERVALS FOR INTENSITIES OF A TWO STAGE OPEN QUEUEING NETWORK WITH FEEDBACK." Journal of Statistics and Mathematics 4, no. 1 (2013):151-161.

Copyright : © 2013, GEDAM V.K. and PATHARE S.B., Published by Bioinfo Publications. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution and reproduction in any medium, provided the original author and source are credited.

Abstract

The aim of this paper is to provide an approximate 100(1-α)% calibrated CAN, Exact t, Standard Bootstrap, Bootstrap-t, Variance-stabilized Bootstrap-t, Bayesian Bootstrap, Percentile Bootstrap and Bias-corrected and accelerated bootstrap confidence intervals for intensity parameters of a two stage open queueing network with feedback with distribution-free interval and service times. Numerical simulation study is conducted to demonstrate performances of the confidence intervals by using calibration technique. We consider a measure, named relative coverage, to evaluate performances of the said intervals.

Keywords

Calibration, calibrated confidence intervals, Coverage percentage, Relative coverage.

Introduction

Calibration technique is used for improving the coverage accuracy of any system of approximate confidence intervals. The general theory of calibration is reviewed in Efron and Tibshirani [6] , following ideas of Loh [16] , Beran [1] , Hall [11] and Hall and Martin [12] . The bootstrap calibration technique was introduced by Loh [16,17] . The idea of the bootstrap calibration is to first use bootstrap to estimate the true coverage of confidence intervals and the intervals is then adjusted by comparing with the target nominal level. As we aware that in literature, no work regarding the calibration technique in queueing networks is found. So it is tempting to use calibration technique to construct new confidence intervals called calibrated confidence interval for intensity parameters of a two stage open queueing network whose true coverage probabilities come closer to desired value.
Consider a network model of a computer system with feedback in which a job may return to previously visited nodes. The system consists of two nodes CPU node and I/O node with respective service rates µ1 and µ2. The external arrival rate is λ. After service completion at CPU node, the job proceeds to the I/O node with probability p1, and departs from the system with probability p0 where p0 = 1-p1. Jobs leaving the I/O node are always feed back to the CPU node [Fig-1] . The successive service time at both nodes are assumed to be mutually independent and independent of the state of the system.
The traffic intensities at the CPU node and I/O node are respectively given by

(1)

where ρ1 and ρ2 can be interpreted as expected number of arrivals per mean service time. The condition for stability of the system is both ρ1 and ρ2 are less than unity.
Burke [2] has shown that the output of an M/M/1 queue is also Poisson with rate λ. Jackson [14] showed that the product form solution also applies to open network of Markovian queues with feedback, also Jackson’s theorem states that each node behaves like an independent queue. Disney [3] introduces basic properties of queueing networks. Thiruvaiyaru, Basawa and Bhat [23] established maximum likelihood estimators of the parameters of an open Jackson network. Thiruvaiyaru and Basawa [22] considered the problem of estimation for the parameters in a Jackson’s type queueing network.
Efron [7-9] the greatest statistician in the field of nonparametric resampling approach, originally developed and proposed the bootstrap, which is a resampling technique that can be effectively applied to estimate the sampling distribution of any statistic. For necessary background on bootstrap technique, we refer to Efron and Gong [4] , Efron and Tibshirani [5] , Guntur [10] , Mooney and Duval [19] , Young [24] , Rubin [21] , Miller [18] . Ke and Chu [15] constructed various confidence intervals for intensity parameter of a queueing system.

Nonparametric Statistical Inference of Intensities

Let (Xi, Yi, i = 1,2) be nonnegative random variables representing the inter-arrival and service times of CPU and I/O node respectively. Once a job complete CPU node burst, it will proceed to I/O node for further service with probability p1 and departs from the system with probability p0 where p0 = 1- p1. Then the intensities are defined as follows:



Where denote the mean inter-arrival times and denote the mean service times of CPU node and I/O node respectively.
Assume that (X1j, p0 Y1j, j= 1,2...n) is a random sample drawn from (X1, Y1) and (p1 X2j, p0 Y2j, j= 1,2...n) is a random sample drawn from(X2, Y2). Define to be the sample means of (Xi, Yi, i= 1,2) respectively. Thus according to the Strong Law of Large Numbers [20] ; we know that are strongly consistent estimator of respectively. Thus strongly consistent estimators of intensities are given by . The true distributions of (Xi, Yi, i= 1,2) are not often known in practice so the exact distributions of , i= 1,2 cannot be derived. But under the assumption that Xi and Yi being independent, the asymptotical distributions of . i= 1,2 can be developed as the following procedures. By Central Limit Theorem and Slutsky’s theorem [13] , we have



Where



Also, denotes convergence in distribution.
Now set



where



Then , i= 1,2 is strongly consistent estimator of , i= 1,2. Again applying the Slutsky’s theorem we have



Thus , i= 1,2 is strongly consistent and asymptotically normal (CAN) estimator with approximate variances , i= 1,2.

Calibration Technique

Let a confidence limit [ α ] is supposed to have probability α of covering the true value ρi, that is, where Fi is unknown continuous probability distribution. Thus ρi is supposed to be less than [0. 95], 95% of the time and [0. 05], 5% of the time. For an approximate confidence limit there is true probability βi that ρi is less than [ α ] say, .
The actual coverage of a confidence procedure is rarely equal to the desired coverage and often it is substantially different. If we knew the function βi(α) then we could calibrate an approximate confidence interval to give exact coverage. Suppose we know that βi(0.03)=0.05 and βi(0.94)=0.95. Then instead of ([0. 05], [0. 95]) we would use ([0. 03], [0. 94]) to get a central 90% interval with correct coverage probabilities.
In practice we usually don’t know the calibration function βi(α). However we can use the bootstrap to estimate βi(α). The bootstrap estimate of βi(α) is where and are fixed, nonrandom quantities and [ α ]* is the αth confidence limit based on bootstrap dataset from . The estimate is obtained by taking B bootstrap data sets and seeing what proportion of them have [ α ]*.

CAN Calibrated Confidence Interval

Using the CAN estimators , i= 1,2 and its associated approximate variances , i = 1,2, we construct calibrated confidence intervals for intensities ρi, i= 1,2 of a two stage open queueing network with feedback. Let Zα be the upper αth quantile of the standard normal distribution.
Compute and
By the asymptotic distribution of an approximate 100 (1 - α) % calibrated confidence intervals for ρi, i= 1,2 are given as

(2)

Exact- t Calibrated Confidence Interval

Let tα be the upper αth quantile of the Student’s t-distribution.
Compute and
Then an approximate 100(1-α)% exact-t calibrated confidence intervals for ρi, i= 1,2 are given as
(3)

Standard Bootstrap Calibrated Confidence Interval

Using bootstrap procedure, a simple random samples
and
are taken from the empirical distribution functions of (Xij, p0 Yij, i=1; j= 1,2...n) and (p1 Xij, p0 Yij, i=2; j = 1,2...n). Bootstrap estimate of ρi, i= 1,2 is calculated as . The above resampling process is repeated N times and are computed from the bootstrap re-samples. Averaging the N bootstrap estimates we get bootstrap estimate of ρi, i= 1,2 as
and standard deviation of , i= 1,2 is



Then by central limit theorem, the distribution of , i= 1,2 is approximately normal. Compute

and

Then 100(1-α)% SB calibrated confidence interval for ρi as,

(4)

Bootstrap-t Calibrated Confidence Interval

Consider N bootstrap estimates computed from the bootstrap resample. We compute
and
follow an approximate t distribution. Also compute

and

Then 100(1-α)% Bootstrap-t calibrated confidence interval for ρi is

(5)

Where and equals the α/2 and (1-α/2) percentile of the random sample .

Variance-stabilized Bootstrap-t Calibrated Confidence Interval

Let , i= 1,2 be a strongly consistent and asymptotically normal estimator with approximate variances . Let
To find a transformation such that constant, we use the first order Taylor series expansion:



Taking expectations on both sides, we get:



Now consider is the variance-stabilizing transformation. Then we have,



Here we consider N bootstrap estimates computed from the bootstrap resample.
We obtain
Also compute

and

A 100(1-α)% Variance- stabilized Bootstrap-t (VST) calibrated confidence interval for ρi, i=1,2 is

(6)

Where and are α/2 and (1-α/2) percentile of the random sample .

Bayesian Bootstrap Calibrated Confidence Interval

Here each BB replication generates a posterior probability for each Xij, i=1, j=1,2...n and p1 Xij, i=1, j=1,2...n. One BB replication is generated by drawing n-1 uniform (0, 1) random numbers r1,r2,...rn-1, ordering them, and calculating the gaps wj= r(j)-r(j-1), j=1,2...n where
r(0)=0 and r(n)=1. Then wi=(wi1,wi2,…,win), i=1,2 is the vector of probabilities attached to the inter-arrival data values (X1j, p1X2j, j=1,2...n) respectively. Next considering all BB replications gives the BB distribution of the distribution of Xi and thus of any parameter of this distribution we calculate µxi i=1,2 (the mean of Xi), in each BB replication. Let wij be the probability that Xi = xij then we calculate and and the distribution of the values of overall BB replications is the BB distribution of µxi.
Now generating a vector of probabilities vi=(vi1,vi2,…,vin), i=1,2 attached to the service time data values p0Yij, i=1,2. j= 1,2...n in a BB replication.
We calculate for µxi.
Thus estimate of Intensity ρi be calculated from BB replications as
.
The above BB process can be repeated N times. The N BB estimates are computed from the BB replications. Averaging the N BB estimates, we obtain that is the BB estimate of ρi, i=1,2 and the standard deviation of can be estimated by



Find and
Applying the asymptotical normality of , i= 1,2, The 100(1-α)% BB calibrated confidence interval for ρi, i= 1,2 is

(7)

Percentile Bootstrap Calibrated Confidence Interval

Now call the bootstrap distribution of ,i= 1,2. Let be the order statistics of i= 1,2.
Compute and
Then utilizing the 100(α/2)th and 100(1-α/2)th percentage points of the bootstrap distribution, a 100(1-α)% PB calibrated confidence interval for ρi, i= 1,2 are obtained as

(8)

where [ x ] denotes the greatest integer less than or equal to x.

Bias-corrected and Accelerated Bootstrap Calibrated Confidence Interval

The bootstrap distribution may be biased, consequently the Percentile Bootstrap confidence interval of intensity method is designed to correct this potential bias of the bootstrap designed.
Set where I(·) is the indicator function.
Define , where Φ-1 denotes the inverse function of the standard normal distribution Φ. Except for correcting the potential bias of the bootstrap distribution, we can accelerate convergence of bootstrap distribution. Let
and denote the original samples with the kth observation deleted, also be the estimator of ρi, i= 1,2 calculated as and
Where and are named bias-correction and acceleration respectively.
Also compute

and

where ,
Thus a 100(1-α)% Bias-corrected and accelerated bootstrap (BCaB) calibrated confidence interval of intensities ρi, i= 1,2 are constructed by

(9)

where

Simulation Study

To evaluate performances of calibrated confidence intervals, numerical simulation study was undertaken. Relative coverage is defined as the ratio of coverage percentage to average length of confidence interval. Larger relative coverage implies the better performances of the corresponding confidence intervals. Here we set a continuous distribution with mean 1/λ on inter-arrival time of X1 and X2 and a continuous distribution with mean 1/µ1 on the service time Y1 at CPU node and that of 1/µ2 on Y2 at I/O node. We have considered the values ρi <1, i=1, 2 for simulation study from [Table-1] . The intensity parameters ρi, i=1, 2 are calculated using [Eq-1] . The different values of λ, µ1, µ2, po and p1 are considered as shown in [Table-1] .
For each level of ρ1 random samples of inter-arrival times and service times (X1j, p0Y1j, j= 1,2...n) are drawn from (X1, Y1) respectively. Also for each level of ρ2 random samples of inter-arrival times and service times (p1X2i, p0Y2i, j= 1,2...n) are drawn from (X2, Y2) respectively. Next N=1000 bootstrap resamples each of size n = 10 and 29 are drawn from the original samples, as well as N=1000 BB replications are simulated for the original samples. According to [Eq-2] to [Eq-9] , we obtain 90% calibrated confidence intervals for intensities ρi, i=1, 2. The above simulation process is replicated N=1000 times and we compute coverage percentages, average lengths and relative coverage of the above mentioned calibrated confidence intervals. We utilize a PC Dual Core and apply Matlab®7.0.1 to accomplish all simulations.
Here C.V. represents coefficient of variation corresponding to the inter-arrival/service time distribution. M represents exponential distribution, E4 a 4-stage Erlang distribution, a 4-stage hyper-exponential distribution and a 4-stage hypo-exponential distribution. Simulated results of , coverage percentage, average lengths and relative coverage for intensities ρi, i=1, 2 of a two stage open queueing network models (presented in [Table-2] ) for 90% calibrated confidence intervals with short run are shown in [Table-3] , [Table-4] , [Table-5] , [Table-6] .
According to the simulation results shown in [Table-3] [Table-6] , we find that average lengths are decreasing but both coverage percentages and relative coverage’s are increasing with sample size n. Also we observe that the coverage percentage can approaches to 90% when n increases to 29.
From [Table-7] , we observe that under M/G/1 to G/M/1 model the calibrated confidence intervals with inter-arrival distribution and service time distribution of small CV (<1) have greater relative coverage than those of large CV (>1) for intensities ρ1 and ρ2. The estimation approaches Variance-Stabilized Bootstrap-t (VST), Bootstrap-t and Bias-corrected and accelerated bootstrap (BCaB) calibrated confidence interval has the greatest relative coverage. Also the calibrated confidence intervals of model M/E4/1 to E4/M/1 shows the greatest relative coverage for ρ1 and ρ2. Similarly under G/G/1 to G/G/1 models the calibrated confidence interval with inter-arrival distribution and service time distribution of large CV(>1) have greatest relative coverage than those of small CV(<1) for intensities ρ1 and ρ2. The estimation approaches BCaB, VST, PB, Bootstrap-t and BB has the greatest relative coverage. Also the calibrated confidence intervals of model E4/H4Pe/1 to H4Pe/E4/1 show the greatest relative coverage for ρ1 and ρ2. Further we observe that average lengths are decreasing and relative coverage increasing with n increases for ρ1 and ρ2. It is important to point out that, some poor coverage percentage of above confidence intervals with respect to the nominal level 90% may be due to small sample size n.

Conclusions

This paper provides the calibrated confidence intervals for intensities ρ1 and ρ2 of two stage open queueing network with feedback. The relative coverage is adopted to understand, compare and assess performance of the resulted confidence intervals. The simulation results imply that VST, Boot-t and BCaB method has the best performance for M/G/1 to G/M/1 and under G/G/1 to G/G/1 the estimation approach PB, VST, Boot-t, BCaB and BB out performs. The above mentioned approaches are easily applied to practical queueing network such as all types of open, closed, mixed queueing networks as well as cyclic, retrial queueing models.

References

[1] Beran R. (1987) Biometrika, 74, 457-468.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[2] Burke P.J. (1956) Operations Research, 4, 699-704.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[3] Disney R.L. (1975) Trans. A.I.E.E., 7, 268-288.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[4] Efron B. and Gong G. (1983) Am. Stat., 37, 36-48.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[5] Efron B. and Tibshirani R.J. (1986) Stat. Sci., 1, 54-77.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[6] Efron B. and Tibshirani R. (1993) An Introduction to the Bootstrap, Chapman and Hall, New York.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[7] Efron B. (1979) Annals of Statistics, 7, 1-26.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[8] Efron B. (1982) SIAM Monograph, 38.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[9] Efron B. (1987) J. Am. Stat. Assoc., 82, 171- 200.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[10] Guntur B. (1991) Quality Progress, 97-103.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[11] Hall P. (1986) Ann. Statist., 14, 1431-1452.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[12] Hall P. and Martin M.A. (1988) Biometrika, 75, 661-671.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[13] Hogg R.V. and Craig A.T. (1995) Introduction to Mathematical Statistics, Prentice- Hall, Inc.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[14] Jackson J.R. (1957) Operations Research, 5, 518- 521.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[15] Ke J.C. and Chu Y.K. (2009) Computational Statistics, 24(4), 567-582.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[16] Loh W.Y. (1987) J. Amer. Statist. Assoc., 82, 155-162.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[17] Loh W.Y. (1991) Statistica sinica, 1, 477-491.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[18] Miller R.G. (1974) Biometrika, 61, 1-15.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[19] Mooney C.Z. and Duval R.D. (1993) Bootstrapping: a nonparameric approach to Statistical inference, SAGE Newbury Park.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[20] Rousses G.G. (1997) A Course in Mathematical Statistics, 2nd ed., Academic Press, New York.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[21] Rubin D.B. (1981) The Annals of Statistics, 9, 130-134.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[22] Thiruvaiyaru D. and Basava I.V. (1996) Stochastic Processes and Statistical Inference, New Age International Publications, New Delhi, 132-149.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[23] Thiruvaiyaru D., Basava I.V. and Bhat U.N. (1991) Queueing Systems, 9, 301-312.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[24] Young G.A. (1994) Stat Sci., 9, 382-415.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

Images
Fig. 1- Two stage open queueing network with feedback
Table 1- Different levels of intensity parameters considered in the simulation study
Table 2- Different queueing network models simulated for study
Table 3- Queueing network model: M/E4/1 to E4/M/1.
Table 4- Queueing network model: M/H4Pe/1 to H4Pe/M/1.
Table 5- Queueing network model: E4/H4Pe/1 to H4Pe/E4/1.
Table 6- Queueing network model: E4/H4Po/1 to H4Po/E4/1. Note [for Table-3 to Table-6] Boldface denotes the greatest relative coverage among estimation approaches. Calibrated confidence intervals of ρ1 under different estimation approaches are denoted by CAN1, Exact-t1, Boot-t1, VST1, SB1, BB1, PB1, BCaB1 and that of ρ2 are denoted by CAN2 Exact-t2, Boot-t2, VST2, SB2, BB2, PB2 and BCaB2.
Table 7- Performances of the estimation approaches of intensities