This paper gives an overview of recurrence and ergodicity properties of a Markov chain. Two new notions for ergodicity and recurrence are introduced. They are called μ -geometric ergodicity and μ -geometric recurrence respectively. The first condition generalises geometric as well as strong ergodicity. Our key theorem shows that μ -geometric ergodicity is equivalent to weak μ -geometric recurrence. The latter condition is verified for the time-discretised two-centre open Jackson network. Hence, the corresponding two-dimensional Markov chain is μ -geometrically and geometrically ergodic, but not strongly ergodic. A consequence of μ -geometric ergodicity with μ of product-form is the convergence of the Laplace-Stieltjes transforms of the marginal distributions. Consequently all moments converge.

In this paper, we develop a unified approach for stochastic load balancing on various multiserver systems. We expand the four partial orderings defined in Marshall and Olkin, by defining a new ordering based on the set of functions that are symmetric, L-subadditive and convex in each variable. This new partial ordering is shown to be equivalent to the previous four orderings for comparing deterministic vectors but differs for random vectors. Sample-path criteria and a probability enumeration method for the new stochastic ordering are established and the ordering is applied to various fork-join queues, routing and scheduling problems. Our results generalize previous work and can be extended to multivariate stochastic majorization which includes tandem queues and queues with finite buffers.

Let s1, …, sn be generated governed by an r-state irreducible aperiodic Markov chain. The partial sum process is determined by a realization of states with s0 = α and the real-valued i.i.d. bounded variables Xαß associated with the transitions si = α, si+1 = β. Assume Χ αβ has negative stationary mean. The explicit limit distribution of the maximal segmental sum is derived. Computational methods with potential applications to the analysis of random Markov-dependent letter sequences (e.g. DNA and protein sequences) are presented.

Rubino and Sericola (1989c) derived expressions for the mth sojourn time distribution associated with a subset of the state space of a homogeneous irreducible Markov chain for both the discrete- and continuous-parameter cases. In the present paper, it is shown that a suitable probabilistic reasoning using absorbing Markov chains can be used to obtain respectively the probability mass function and the cumulative distribution function of the joint distribution of the first m sojourn times. A concise derivation of the continuous-time result is achieved by deducing it from the discrete-time formulation by time discretization. Generalizing some further recent results by Rubino and Sericola (1991), the joint distribution of sojourn times for absorbing Markov chains is also derived. As a numerical example, the model of a fault-tolerant multiprocessor system is considered.

This article reviews results related to event and time averages (EATA) for point process models, including PASTA, ASTA and ANTIPASTA under general hypotheses. In particular, the results for the stationary case relating the Palm and martingale approach are reviewed. The non-stationary case is discussed in the martingale framework where minimal conditions for ASTA generalizing earlier work are presented in a unified framework for the discrete- and continuous-time cases. In addition, necessary and sufficient conditions for ASTA to hold in the stationary case are discussed in the case even when stochastic intensities may not exist and a short proof of the ANTIPASTA results known to date are given.

A single machine is available to process a collection of stochastic jobs preemptively. Rewards are received at job completions. We seek policies for machine allocation which maximize the total reward. Application areas point to the need to study such models for resource allocation when job processing requirements are dependent. To this end, models are developed in which the nature of such dependence is derived from various notions of positive and negative dependence in common usage in reliability. Optimal policies for resource allocation of simple structure are obtained for a variety of such models.

The problem of estimating the transfer function of a linear system, together with the spectral density of an additive disturbance, is considered. The set of models used consists of linear rational transfer functions and the spectral densities are estimated from a finite-order autoregressive disturbance description. The true system and disturbance spectrum are, however, not necessarily of finite order. We investigate the properties of the estimates obtained as the number of observations tends to ∞ at the same time as the model order employed tends to ∞. It is shown that the estimates are strongly consistent and asymptotically normal, and an expression for the asymptotic variances is also given. The variance of the transfer function estimate at a certain frequency is related to the signal/noise ratio at that frequency and the model orders used, as well as the number of observations. The variance of the noise spectral estimate relates in a similar way to the squared value of the true spectrum.

The problem of where to allocate a redundant component in a system in order to optimize the lifetime of a system is an important problem in reliability theory which also poses many interesting questions in mathematical statistics. We consider both active redundancy and standby redundancy, and investigate the problem of where to allocate a spare in a system in order to stochastically optimize the lifetime of the resulting system. Extensive results are obtained in particular for series and parallel systems.

The M/G/1 queue with batch arrivals and a queueing discipline which is a generalization of processor sharing is studied by means of Crump–Mode–Jagers branching processes. A number of theorems are proved, including investigation of heavy traffic and overloaded queues. Most of the results obtained are also new for the M/G/1 queue with processor sharing. By use of a limiting procedure we also derive new results concerning M/G/1 queues with shortest residual processing time discipline.

For a two-dimensional random walk {X (n) = (X(n)1, X(n)2)T, n ∈ ℕ0} with correlated components the first-crossing-time probability problem through unit-slope straight lines x2 = x1 - r(r = 0,1) is analysed. The p.g.f.'s for the first-crossing-time probabilities are expressed as solutions of a fourth-degree algebraic equation and are then exploited to obtain the first-crossing-time probabilities. Several additional results, including the mean first-crossing time and the probability of ultimate crossing, are also given.

In this paper we investigate dynamic routing in queueing networks. We show that there is a heavy traffic limiting regime in which a network model based on Brownian motion can be used to approximate and solve an optimal control problem for a queueing network with multiple customer types. Under the solution of this approximating problem the network behaves as if the service-stations of the original system are combined to form a single pooled resource. This resource pooling is a result of dynamic routing, it can be achieved by a form of shortest expected delay routing, and we find that dynamic routing can offer substantial improvements in comparison with less responsive routing strategies.

This paper studies computer simulation methods for estimating the sensitivities (gradient, Hessian etc.) of the expected steady-state performance of a queueing model with respect to the vector of parameters of the underlying distribution (an example is the gradient of the expected steady-state waiting time of a customer at a particular node in a queueing network with respect to its service rate). It is shown that such a sensitivity can be represented as the covariance between two processes, the standard output process (say the waiting time process) and what we call the score function process which is based on the score function. Simulation procedures based upon such representations are discussed, and in particular a control variate method is presented. The estimators and the score function process are then studied under heavy traffic conditions. The score function process, when properly normalized, is shown to have a heavy traffic limit involving a certain variant of two-dimensional Brownian motion for which we describe the stationary distribution. From this, heavy traffic (diffusion) approximations for the variance constants in the large sample theory can be computed and are used as a basis for comparing different simulation estimators. Finally, the theory is supported by numerical results.

The distribution (1) used previously by the author to represent polymerisation of several types of unit also prescribes quite general statistics for a random field on a random graph. One has the integral expression (3) for its partition function, but the multiple complex form of the integral makes the nature of the expected saddlepoint evaluation in the thermodynamic limit unclear. It is shown in Section 4 that such an evaluation at a real positive saddlepoint holds, and subsidiary conditions narrowing down the choice of saddlepoint are deduced in Section 6. The analysis simplifies greatly in what is termed the semi-coupled case; see Sections 3, 5 and 7. In Section 8 the analysis is applied to an Ising model on a random graph of fixed degree r + 1. The Curie point of this model is found to agree with that deduced by Spitzer for an Ising model on an r-branching tree. This agreement strengthens the conclusion of ‘locally tree-like' behaviour of the graph, seen as an important property in a number of contexts.

Consider m queueing stations in tandem, with infinite buffers between stations, all initially empty, and an arbitrary arrival process at the first station. The service time of customer j at station i is geometrically distributed with parameter pi, but this is conditioned on the fact that the sum of the m service times for customer j is cj. Service times of distinct customers are independent. We show that for any arrival process to the first station the departure process from the last station is statistically unaltered by interchanging any of the pi's. This remains true for two stations in tandem even if there is only a buffer of finite size between them. The well-known interchangeability of ·/M/1 queues is a special case of this result. Other special cases provide interesting new results.

This paper complements two previous studies (Daley and Rolski (1984), (1991)) by investigating limit properties of the waiting time in k-server queues with renewal arrival process under ‘light traffic' conditions. Formulae for the limits of the probability of waiting and the waiting time moments are derived for the two approaches of dilation and thinning of the arrival process. Asmussen's (1991) approach to light traffic limits applies to the cases considered, of which the Poisson arrival process (i.e. M/G/k) is a special case and for which formulae are given.