In this article we study stochastic perturbations of partial differential equations describing forced-damped vibrations of a string. Two models of such stochastic disturbances are considered; one is triggered by an initial white noise, and the other is in the form of non-Gaussian random forcing. Let uε (t, x) be the displacement at time t of a point x on a string, where the time variable t ≧ 0, and the space variable . The small parameter ε controls the intensity of the random fluctuations. The random fields uε (t, x) are shown to satisfy a large deviations principle, and the random deviations of the unperturbed displacement function are analyzed as the noise parameter ε tends to zero.

We examine the existence of limiting behavior, or stability, for storage models with shot noise input and general release rules. The shot noise feature of the input process allows the individual inputs to gradually enter the store.

We first show that a store under the unit release rule is stable if and only if the traffic intensity is less than one; this extends the classic result of Prabhu (1980) to the case of shot noise input. The stability of the unit release rule store and various stochastic orderings are then used to derive a sufficient condition for a store with a general release rule to be stable. Finally, we show that when restricted to a compact state space, our storage model is always stable.

An important component of the paper is the methodology employed: coupling and stochastic monotonicity play a key role in analyzing the non-Markov processes encountered.

We consider a stochastic fluid network with independent subordinator inputs to the various stations and deterministic internal flow which is of feed-forward type. We show that under suitable conditions the process of fluid contents in the station has a limiting distribution, where the limit holds in total variation and is independent of the initial condition. We also show that this limiting distribution is of product form only for trivial setups.

The comparison of optimal strategies in a simple stochastic replacement model for two types of machines with identical cost characteristics when one of them is more reliable than the other is conducted. It is proven that the scheduled replacement period for the more reliable type is always less than for the less reliable one. An example is presented when even the expected period of use of a more reliable machine is less than the expected period for the less reliable one. Some related problems are briefly discussed.

We consider a dam in which the release rate depends both on the state and some modulating process. Conditions for the existence of a limiting distribution are established in terms of an associated risk process. The case where the release rate is a product of the state and the modulating process is given special attention, and in particular explicit formulas are obtained for a finite state space Markov modulation.

We establish stability, monotonicity, concavity and subadditivity properties for open stochastic storage networks in which the driving process has stationary increments. A principal example is a stochastic fluid network in which the external inputs are random but all internal flows are deterministic. For the general model, the multi-dimensional content process is tight under the natural stability condition. The multi-dimensional content process is also stochastically increasing when the process starts at the origin, implying convergence to a proper limit under the natural stability condition. In addition, the content process is monotone in its initial conditions. Hence, when any content process with non-zero initial conditions hits the origin, it couples with the content process starting at the origin. However, in general, a tight content process need not hit the origin.

We analyse the queue QL at a multiplexer with L sources which may display long-range dependence. This includes, for example, sources modelled by fractional Brownian motion (FBM). The workload processes W due to each source are assumed to have large deviation properties of the form P[Wt/a(t) > x] ≈ exp[– v(t)K(x)] for appropriate scaling functions a and v, and rate-function K. Under very general conditions limL→xL–1 log P[QL > Lb] = – I(b), provided the offered load is held constant, where the shape function I is expressed in terms of the cumulant generating functions of the input traffic. For power-law scalings v(t) = tv, a(t) = ta (such as occur in FBM) we analyse the asymptotics of the shape function limb→xb–u/a(I(b) – δbv/a) = vu for some exponent u and constant v depending on the sources. This demonstrates the economies of scale available though the multiplexing of a large number of such sources, by comparison with a simple approximation P[QL > Lb] ≈ exp[−δLbv/a] based on the asymptotic decay rate δ alone. We apply this formula to Gaussian processes, in particular FBM, both alone, and also perturbed by an Ornstein–Uhlenbeck process. This demonstrates a richer potential structure than occurs for sources with linear large deviation scalings.

We consider a variation of the M/G/1 queue in which, when the system contains more than k customers, it switches from its initial general service distribution to a different general service distribution until the server is cleared, whereupon it switches back to the original service distribution. Using a technique due to Baccelli and Makowski we define a martingale with respect to an embedded process and from this arrive at a relationship between the process and a modified Markov renewal process. Using this an analysis of the stationary behaviour of the queue is possible.

The time-dependent virtual waiting time in a M/G/1 queue converges to a proper limit when the traffic intensity is less than one. In this paper we give precise rates on the speed of this convergence when the service time distribution has a heavy regularly varying tail.

The result also applies to the classical ruin problem. We obtain the exact rate of convergence for the ruin probability after time t for the case where claims arrive according to a Poisson process and claim sizes are heavy tailed.

Our result supplements similar theorems on exponential convergence rates for relaxation times in queueing theory and ruin probabilities in risk theory.

We consider the machine repairman, or resource utilization, model in which there is a finite source of jobs with non-identically distributed exponential return times and a single server with job dependent service times. We also consider a related problem of scheduling jobs at heterogeneous servers. We construct a coupling framework that provides a simple unified proof that strengthens many of the results in the literature, and generalizes easily to prove several new results.

This paper presents an analysis of the single-server discrete-time finite-buffer queue with general interarrival and geometric service time, GI/Geom/1/N. Using the supplementary variable technique, and considering the remaining interarrival time as a supplementary variable, two variations of this model, namely the late arrival system with delayed access (LAS-DA) and early arrival system (EAS), have been examined. For both cases, steady-state distributions for outside observers as well as at random and prearrival epochs have been obtained. The waiting time analysis has also been carried out. Results for the Geom/G/1/N queue with LAS-DA have been obtained from the GI/Geom/1/N queue with EAS. We also give various performance measures. An algorithm for computing state probabilities is given in an appendix.

Consider a queueing network with batch services at each node. The service time of a batch is exponential and the batch size at each node is arbitrarily distributed. At a service completion the entire batch coalesces into a single unit, and it either leaves the system or goes to another node according to given routing probabilities. When the batch sizes are identical to one, the network reduces to a classical Jackson network. Our main result is that this network possesses a product form solution with a special type of traffic equations which depend on the batch size distribution at each node. The product form solution satisfies a particular type of partial balance equation. The result is further generalized to the non-ergodic case. For this case the bottleneck nodes and the maximal subnetwork that achieves steady state are determined. The existence of a unique solution is shown and stability conditions are established. Our results can be used, for example, in the analysis of production systems with assembly and subassembly processes.

We study a model of a stochastic transportation system introduced by Crane. By adapting constructions of multidimensional reflected Brownian motion (RBM) that have since been developed for feedforward queueing networks, we generalize Crane's original functional central limit theorem results to a full vector setting, giving an explicit development for the case in which all terminals in the model experience heavy traffic conditions. We investigate product form conditions for the stationary distribution of our resulting RBM limit, and contrast our results for transportation networks with those for traditional queueing network models.

Using sample path analysis we show that under the same load the mean delay in queue in the M/G/2 system is smaller than that in the corresponding M/G/1 system, when the service time has either the DMRL or NBU property and the service discipline is FCFS. The proof technique uses a new device that equalizes the work in a two server system with that in a single sterver system. Other interesting quantities such as the average difference in work between the two servers in the GI/G/2 system and an exact alternate derivation of the mean delay in the M/M/2 system from sample path analysis are presented. For the same load, we also show that the mean delay in the M/G/C system with general service time distribution is smaller than that in the M/G/1 system when the traffic intensity is less than 1/c.

A disaster occurs in a queue when a negative arrival causes all the work (and therefore customers) to leave the system instantaneously. Recent papers have addressed several issues pertaining to queueing networks with negative arrivals under the i.i.d. exponential service times assumption. Here we relax this assumption and derive a Pollaczek–Khintchine-like formula for M/G/1 queues with disasters by making use of the preemptive LIFO discipline. As a byproduct, the stationary distribution of the remaining service time process is obtained for queues operating under this discipline. Finally, as an application, we obtain the Laplace transform of the stationary remaining service time of the customer in service for unstable preemptive LIFO M/G/1 queues.

More applications of the principle for interchanging components due to Boland et al. (1989) in reliability theory are presented. In the context of active redundancy improvement we show that if two nodes are permutation equivalent then allocating a redundancy component to the weaker position always results in a larger increase in system reliability, which generalizes a previous result due to Boland et al. (1992). In the case of standby redundancy enhancement, we prove that a series (parallel) system is the only system for which standby redundancy at the component level is always more (less) effective than at the system level. Finally, the principle for interchanging components is extended from binary systems to the more complicated multistate systems.

This paper considers a modified block replacement with two variables and general random minimal repair cost. Under such a policy, an operating system is preventively replaced by new ones at times kT (k= 1, 2, ···) independently of its failure history. If the system fails in [(k − 1)T, (k − 1)T+ T0) it is either replaced by a new one or minimally repaired, and if in [(k − 1) T + T0, kT) it is either minimally repaired or remains inactive until the next planned replacement. The choice of these two possible actions is based on some random mechanism which is age-dependent. The cost of the ith minimal repair of the system at age y depends on the random part C(y) and the deterministic part ci (y). The expected cost rate is obtained, using the results of renewal reward theory. The model with two variables is transformed into a model with one variable and the optimum policy is discussed.

As a model for an ATM switch we consider the overflow frequency of a queue that is served at a constant rate and in which the arrival process is the superposition of N traffic streams. We consider an asymptotic as N → ∞ in which the service rate Nc and buffer size Nb also increase linearly in N. In this regime, the frequency of buffer overflow is approximately exp(–NI(c, b)), where I(c, b) is given by the solution to an optimization problem posed in terms of time-dependent logarithmic moment generating functions. Experimental results for Gaussian and Markov modulated fluid source models show that this asymptotic provides a better estimate of the frequency of buffer overflow than ones based on large buffer asymptotics.

We consider a heavy traffic regime in queueing systems with identical service. These systems belong to the class of multi-phase systems with dependent service times in different service nodes. We study the limit behaviour of the waiting time vector in heavy traffic. Both transient behaviour and the stationary regime are considered. Our analysis is based on the conception of ‘approximated functionals', which appeared to be fruitful in weak convergence theory of stochastic processes.