We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This paper is concerned with the description of both a deterministic and stochastic branching procedure. The renewal equations for the deterministic branching population are first derived which allow for asymptotic results on the ‘number' and ‘generation' processes. A probabilistic version of these processes is then studied which presents some discrepancy with the standard Harris age-dependent branching processes.
This paper examines the availability of a maintained system where the rate of deterioration is governed by an exogenous random environment. We provide a qualitative result that exposes the relationship between remaining lifetime, environment, and repairs. This result leads to simple bounds that can be used to choose inspection rates that guarantee a specified level of availability. The principal result requires no specific distributional assumptions, is intuitively appealing and can be directly applied by practitioners. Our development employs techniques from stochastic calculus.
Recently defined classes of life distributions are considered, and some relationships among them are proposed. The life distribution H of a device subject to shocks occurring randomly according to a Poisson process is also considered, and sufficient conditions for H to belong to these classes are discussed.
It has recently been shown that networks of queues with state-dependent movement of negative customers, and with state-independent triggering of customer movement have product-form equilibrium distributions. Triggers and negative customers are entities which, when arriving to a queue, force a single customer to be routed through the network or leave the network respectively. They are ‘signals' which affect/control network behaviour. The provision of state-dependent intensities introduces queues other than single-server queues into the network.
This paper considers networks with state-dependent intensities in which signals can be either a trigger or a batch of negative customers (the batch size being determined by an arbitrary probability distribution). It is shown that such networks still have a product-form equilibrium distribution. Natural methods for state space truncation and for the inclusion of multiple customer types in the network can be viewed as special cases of this state dependence. A further generalisation allows for the possibility of signals building up at nodes.
Let F be the gamma distribution function with parameters a > 0 and α > 0 and let Gs be the negative binomial distribution function with parameters α and a/s, s > 0. By combining both probabilistic and approximation-theoretic methods, we obtain sharp upper and lower bounds for . In particular, we show that the exact order of uniform convergence is s–p, where p = min(1, α). Various kinds of applications concerning charged multiplicity distributions, the Yule birth process and Bernstein-type operators are also given.
The double-stranded molecule, DNA, has the unique property of replication and, because of this, it is the central molecule of life. The mechanism of replication for each single strand is intricate, involving enzymes which move along each of the single strands building a complementary copy. At the frontier of this action, the events have a strong stochastic character due to the random location on the DNA of key ‘sites' where copying commences. A model of this process is analysed. The central problem of interest is the mean length of certain ‘islands' of newly replicated DNA developed at the randomly located ‘sites'. These islands, which have been observed experimentally, are called Okazaki fragments.
Consider GI/G/1 processor sharing queues with traffic intensity tending to 1. Using the theory of random measures and the theory of branching processes we investigate the limiting behaviour of the queue length, sojourn time and random measures describing attained and residual processing times of customers present.
The effects of dependencies (such as association) in the arrival process to a single server queue on mean queue lengths and mean waiting times are studied. Markov renewal arrival processes with a particular transition matrix for the underlying Markov chain are used which allow us to change dependency properties without at the same time changing distributional conditions. It turns out that correlations do not seem to be pure effects, and three main factors are studied: (a) differences in the mean interarrival times in the underlying Markov renewal process, (b) intensity in the Markov renewal jump process, (c) variability in the point processes underlying the Markov renewal process. It is shown that the mean queue length can be made arbitrarily large in the class of queues with the same interarrival distributions and the same service time distributions (with fixed smaller than one traffic intensity), by making (a) large enough and (b) small enough. The existence of the moments of interest is confirmed and some stochastic comparison results for actual waiting times are shown.
We provide the explicit expression for the mean coverage function of a generalized voter model on a regular lattice and establish a characterization of the class of the above processes. As a result, we derive the exact rate of convergence of the considered processes to the steady state. We also prove the existence of different processes with the same mean coverage function on a given lattice.
A Markov-modulated Poisson process (MMPP) is a Poisson process whose rate is a finite Markov chain. The Poisson process is a simple MMPP. An MMPP/M/1 queue is a queue with MMPP arrivals, an infinite capacity, and a single exponential server. We prove that the output of an MMPP/M/1 queue is not an MMPP process unless the input is Poisson. We derive this result by analyzing the structure of the non-linear filter of the state given the departure process of the queue. The practical relevance of the result is that it rules out the existence of simple finite descriptions of queueing networks with MMPP inputs.
This paper examines the infinitely high dam with seasonal (periodic) Lévy input under the unit release rule. We show that a periodic limiting distribution of dam content exists whenever the mean input over a seasonal cycle is less than 1. The Laplace transform of dam content at a finite time and the Laplace transform of the periodic limiting distribution are derived in terms of the probability of an empty dam. Necessary and sufficient conditions for the periodic limiting distribution to have finite moments are given. Convergence rates to the periodic limiting distribution are obtained from the moment results. Our methods of analysis lean heavily on the coupling method and a stochastic monotonicity result.
In this paper a particular loss network consisting of two links with C1 and C2 circuits, respectively, and two fixed routes, is investigated. A call on route 1 uses a circuit from both links, and a call on route 2 uses a circuit from only the second link. Calls requesting routes 1 and 2 arrive as independent Poisson streams. A call requesting route 1 is blocked and lost if there are no free circuits on either link, and a call requesting route 2 is blocked and lost if there is no free circuit on the second link. Otherwise the call is connected and holds a circuit from each link on its route for the holding period of the call.
The case in which the capacities C1, and C2, and the traffic intensities v1, and v2, all become large of O(N) where N » 1, but with their ratios fixed, is considered. The loss probabilities L1 and L2 for calls requesting routes 1 and 2, respectively, are investigated. The asymptotic behavior of L1 and L2 as N→ ∞ is determined with the help of double contour integral representations and saddlepoint approximations. The results differ in various regions of the parameter space (C1, C2, v1, v2). In some of these results the loss probabilities are given in terms of the Erlang loss function, with appropriate arguments, to within an exponentially small relative error. The results provide new information when the loss probabilities are exponentially small in N. This situation is of practical interest, e.g. in cellular systems, and in asynchronous transfer mode networks, where very small loss probabilities are desired.
The accuracy of the Erlang fixed-point approximations to the loss probabilities is also investigated. In particular, it is shown that the fixed-point approximation E2 to L2 is inaccurate in a certain region of the parameter space, since L2 « E2 there. On the other hand, in some regions of the parameter space the fixed-point approximations to both L1 and L2 are accurate to within an exponentially small relative error.
We consider an Mx/G/1 queueing system with N-policy and multiple vacations. As soon as the system empties, the server leaves for a vacation of random length V. When he returns, if the queue length is greater than or equal to a predetermined value N(threshold), the server immediately begins to serve the customers. If he finds less than N customers, he leaves for another vacation and so on until he finally finds at least N customers. We obtain the system size distribution and show that the system size decomposes into three random variables one of which is the system size of ordinary Mx/G/1 queue. The interpretation of the other random variables will be provided. We also derive the queue waiting time distribution and other performance measures. Finally we derive a condition under which the optimal stationary operating policy is achieved under a linear cost structure.
A one-dimensional packing approach is used to obtain limiting results for inter-crack distances after multiple fracture of a long brittle-matrix composite with continuous aligned fibres. The results may also be appropriate for applications of the Rényi car-parking model in which there is a reduced probability of cars parking bumper to bumper.
In this paper we consider the problem of routing customers to identical servers, each with its own infinite-capacity queue. Under the assumptions that (i) the service times form a sequence of independent and identically distributed random variables with increasing failure rate distribution and (ii) state information is not available, we establish that the round-robin policy minimizes, in the sense of a separable increasing convex ordering, the customer response times and the numbers of customers in the queues.
We present structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties. In addition to linear holding costs, we impose either lump sum switching costs or batch set-up delays which are incurred at each instant the server processes a job in a queue different from the previous one. We use reward rate notions to unearth conditions on the holding costs and service distributions for which an exhaustive policy is optimal. For the case of two nodes connected probabilistically in tandem, we explicitly define an optimal policy under similar conditions.
This paper investigates inspection strategies for a finite-state continuous-time Markovian deteriorating system. Two inspection strategies are considered: sequential inspection and continuous inspection. Unlike many previous efforts, the inspection times for the sequential inspection strategy are assumed to be non-negligible. The replacement times and costs for both strategies are non-negligible and state dependent. Our objective here is to minimize the expected long-run cost rate. Iterative algorithms are provided to derive the optimal policies for both strategies. The structures of these optimal policies and their corresponding optimal cost rates are discussed and compared.
Consider a workstation with one server, performing jobs with a service time, Y, having distribution function, G(t). Assume that the station is unreliable, in that it occasionally breaks down. The station is instantaneously repaired, and the server restarts the uncompleted job from the beginning. Let T denote the time it takes to complete each job. If G(t) is exponential with parameter A, then because of the lack-of-memory property of the exponential, P (T > t) = Ḡ(t) =exp(−γt), irrespective of when and how the failures occur. This property also characterizes the exponential distribution.
We prove that the expected number of particles of the critical contact process on a homogeneous tree is bounded above. This is the first graph for which the behavior of the expected number of particles of the critical contact process is known. As an easy corollary of our result we get that the critical contact process dies out on any homogeneous tree. This completes the work of Pemantle (1992).
Burn-in is a widely used method to improve quality of products after they have been produced. For a repairable component there are two common types of repair, complete repair and minimal repair. Preventive maintenance policies such as age replacement and block replacement are often employed in field operation. The present paper takes burn-in, maintenance and repair into consideration at the same time and considers related cost structures. The properties of the corresponding optimal burn-in times and optimal maintenance policies are discussed.