SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING

We study sojourn times of customers in a processor sharing queue with a service rate that varies over time, depending on the number of customers and on the state of a random environment. An explicit expression is derived for the Laplace–Stieltjes transform of the sojourn time conditional on the state upon arrival and the amount of work brought into the system. Particular attention is paid to the conditional mean sojourn time of a customer as a function of his required amount of work, and we establish the existence of an asymptote as the amount of work tends to infinity. The method of random time change is then extended to include the possibility of a varying service rate. By means of this method, we explain the well-established proportionality between the conditional mean sojourn time and required amount of work in processor sharing queues without random environment. Based on numerical experiments, we propose an approximation for the conditional mean sojourn time. Although first presented for exponentially distributed service requirements, the analysis is shown to extend to phase-type services. The service discipline of discriminatory processor sharing is also shown to fall within the framework.     

First-exit times for compound poisson processes for some types of positive and negative jumps

We consider the one-sided and the two-sided first-exit problem for a compound Poisson process with linear deterministic decrease between positive and negative jumps. This process (X(t)) _t≥0 occurs as the workload process of a single-server queueing system with random workload removal, which we denote by M/G _u /G _d /1, where G _u (G _d ) stands for the distribution of the upward (downward) jumps; other applications are to cash management, dams, and several related fields. Under various conditions on G _u and G _d (assuming e.g. that one of them is hyperexponential, Erlang or Coxian), we derive the joint distribution of τ _y =inf{t≥0|X(t)?(0,y)}, y>0, and X(τ _y ) as well as that of T=inf{t≥0|X(t)≤0} and X(T). We also determine the distribution of sup{X(t)|0≤t≤T}.     

Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique

Abstract

We investigate polynomial factorization as a classical analysis method for servers with semi-Markov arrival and service processes. The modeling approach is directly applicable to queueing systems and servers in production lines and telecommunication networks, where the flexibility in adaptation to autocorrelated processes is essential.

Although the method offers a compact form of the solution with favourable computation time complexity enabling to consider large state spaces and system equations of high degree, numerical stability is not guaranteed for this approach. Therefore we apply interval arithmetic in order to get verified results for the workload distributions, or otherwise to indicate that the precision of the computation has to be improved. The paper gives an overview of numerical and performance aspects of factorization in comparison to alternative methods.     

Estimation and Welfare Analysis With Large Demand Systems

We develop an approach for estimating individual or household level preferences for a large set of quality-differentiated goods and for constructing Hicksian welfare measures within the demand system framework. Our approach uses a maximum simulated likelihood procedure to recover estimates of the structural parameters and a multistage, Monte Carlo Markov chain algorithm for constructing Hicksian consumer surplus estimates. We illustrate our approach with a recreation dataset consisting of day trips to 62 Mid-Atlantic beaches.     

A plug-in technique in nonparametric regression with dependence

The problem addressed is that of smoothing parameter selection in kernel nonparametric regression in the fixed design regression model with dependent noise. An asymptotic expression of the optimum bandwidth parameter has been obtained in recent studies, where this takes the form h = C ₀ n ^?1/5. This paper proposes to use a plug-in methodology, in order to obtain an optimum estimation of the bandwidth parameter, through preliminary estimation of the unknown value of C ₀.     

On some probability distributions associated with random walks

The probability distribution of the total number of games to ruin in a gambler's ruin random walk with initial position n, the probability distribution of the total size of an epidemic starting with n cases and the probability distribution of the number of customers served during a busy period M/M/1 when the service starts with n waiting customers are identical. All these can be easily obtained by using Lagrangian expansions instead of long combinatorial methods. The binomial, trinomial, quadrinomial and polynomial random walks of a particle have been considered with an absorbing barrier at 0 when the particle starts its walks from a point n, and the pgfs. and the probability distributions of the total number of jumps (trials) before absorption at 0 have been obtained. The values for the mean and variance of such walks have also been given.     

On the level probabilities for useful partially ordered alternatives in the analysis of variance

In the analysis of variance, we often encounter situations in which we want to test the null hypothesis of homogeneity of the normal means against various partially ordered alternative hypotheses. We study likelihood ratio tests for three useful types of alternatives: d-star, bipartite and broom tree. Especially, we give computational formulas for the level probabilities of the alternative types. The results permit us to obtain critical values for practical use.     

The periodogram regression:correction and comments

Ratios of periodogram and spectral density at different harmonic frequencies are independent if the frequency zero is approached slowly enough. This is an asymptotically relevant condition for the periodogram regression to work with fractionally integrated series. In finite samples, however, this theoretical condition should be ignored as we illustrate experimentally.     

The neyman accuracy and the wolfowitz accuracy of the stein type confidence interval for the disturbance variance

In this paper we consider the Neyman accuracy and the Wolfowitz accuracy of the Stein type improved confidence interval I?_S for the disturbance variance in a linear regression model. The Neyman accuracy is a measure related to the unbiasedness of a confidence interval, and the Wolfowitz accuracy is related to the closeness of the endpoints to the true parameter. We show that I?_S is not unbiased and give some numerical results for the Neyman accuracy. As for the Wolfowitz accuracy we derive the sufficient condition for I?_S to improve on the usual confidence interval under this criterion and show numerically that a large degree of improvement can be obtainted.