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.
A Markovian arrival stream is a marked point process generated by the state transitions of a given Markovian environmental process and Poisson arrival rates depending on the environment. It is shown that to a given marked point process there is a sequence of such Markovian arrival streams with the property that as m →∞. Various related corollaries (involving stationarity, convergence of moments and ergodicity) and counterexamples are discussed as well.
Tandem queueing systems with blocking are frequently used in modelling of data communications and production transfer lines. We study such a system with no intermediate queues under the communication and the manufacturing blocking schemes and the assumption of just-in-time input. Explicit expressions for residence times, departure times, equilibrium throughput and some other measures of performance are obtained for the case of equal service requirements at all servers. This case is shown to be the ‘worst’ under the manufacturing blocking scheme, but not under the communication blocking scheme. An approximation formula is proposed for the equilibrium throughput in the case of exponential i.i.d. service times under the manufacturing blocking scheme.
A steady-state analysis of an M/G/1 queue with a finite capacity (K) and a finite population (N) of customers is given. The queue size distribution in this M/G/1/K/N system can be derived from the known queue size distribution in the corresponding M/G/1//N system. The system throughput, the mean response time, and the blocking probability are then calculated. The joint distributions of the queue size and the remaining service times are used to obtain the distributions of the unfinished work in the service facility and the waiting time of an accepted customer.
We obtain a single formula which, when its components are adequately chosen, transforms itself into the main formulas of the Palm theory of point processes: Little's L = λW formula [10], Brumelle's H = λG formula [5], Neveu's exchange formula [14], Palm inversion formula and Miyazawa's rate conservation law [12]. It also contains various extensions of the above formulas and some new ones.
In the biased annihilating branching process, particles place offspring on empty neighboring sites at rate A and destroy neighbors at rate 1. It is conjectured that for any λ ≥ 0 the population will spread to ∞, and this is shown in one dimension for The process on a finite graph when starting with a non-empty configuration has limiting distribution vλ /(λ +1), the product measure with density λ/(1 +λ). It is shown that vλ /(λ +1) and δ Ø are the only stationary distributions on Moreover, if and the initial configuration is non-empty, then the limiting measure is vλ /(λ +1) provided the initial measure converges.
In this paper we introduce the concept of repair replacement. Repair replacement is a maintenance policy in which items are preventively maintained when a certain time has elapsed since their last repair. This differs from age replacement where a certain amount of time has elapsed since the last replacement. If the last repair was a complete repair, repair replacement is essentially the same as age replacement. It is in the case of minimal repair that these two policies differ. We make comparison between various types of policies in order to determine when and under which condition one type of policy is better than another.
It is known (Weizsäcker and Winkler (1990)) that for bounded predictable functions H and a Poisson process with jump times
exists almost surely, and that in this case both limits are equal. Here we relax the boundedness condition on H. Our tool is a law of large numbers for local L2-martingales. We show by examples that our condition is close to optimal. Furthermore we indicate a generalization to point processes on more general spaces. The above property is called PASTA (‘Poisson arrivals see time averages') and is heavily used in queueing theory.
The Type I and Type II counter models of Pyke (1958) have many applications in applied probability: in reliability, queueing and inventory models, for example. In this paper, we study the case in which the interarrival time distribution is of phase type. For the two counter models, we derive the renewal functions of the related renewal processes and propose approaches for their computations.
This paper is devoted to the study of a stationary G/G/1 queue in which work input is gradually injected into the system and the work load is processed at unit rate. First, assuming that the input process is stationary, the key formula for the stationary distribution of work in system is derived by appeal to the waiting time of the associated regular G/G/1 queue. The main contribution of this paper is the derivation of Laplace-Stieltjes transforms (LSTs) for the stationary distributions of work in system and related random variables in terms of integrations with respect to a waiting time distribution of the associated regular queue. The results are exemplified by giving explicit formulas for the LST of total work for M/Ek/1 and M/H2/1. The results generalize the results of Pan et al. (1991) for the M/M/1 gradual input queue.
Using Palm-martingale calculus, we derive the workload characteristic function and queue length moment generating function for the BMAP/GI/1 queue with server vacations. In the queueing system under study, the server may start a vacation at the completion of a service or at the arrival of a customer finding an empty system. In the latter case we will talk of a server set-up time. The distribution of a set-up time or of a vacation period after a departure leaving a non-empty system behind is conditionally independent of the queue length and workload. Furthermore, the distribution of the server set-up times may be different from the distribution of vacations at service completion times. The results are particularized to the M/GI/1 queue and to the BMAP/GI/1 queue (without vacations).
We consider the problem of routing jobs to parallel queues with identical exponential servers and unequal finite buffer capacities. Service rates are state-dependent and non-decreasing with respect to queue lengths. We establish the extremal properties of the shortest non-full queue (SNQ) and the longest non-full queue (LNQ) policies, in systems with concave/convex service rates. Our analysis is based on the weak majorization of joint queue lengths which leads to stochastic orderings of critical performance indices. Moreover, we solve the buffer allocation problem, i.e. the problem of how to distribute a number of buffers among the queues. The two optimal allocation schemes are also ‘extreme', in the sense of capacity balancing. Some extensions are also discussed.
Given a parametric family of regenerative processes on a common probability space, we investigate when the derivatives (with respect to the parameter) are regenerative. We primarily consider sequences satisfying explicit, Lipschitz recursions, such as the waiting times in many queueing systems, and show that derivatives regenerate together with the original sequence under reasonable monotonicity or continuity assumptions. The inputs to our recursions are i.i.d. or, more generally, governed by a Harris-ergodic Markov chain. For i.i.d. input we identify explicit regeneration points; otherwise, we use coupling arguments. We give conditions for the expected steady-state derivative to be the derivative of the steady-state mean of the original sequence. Under these conditions, the derivative of the steady-state mean has a cycle-formula representation.
We show that for a large class of one-dimensional interacting particle systems, with a finite initial configuration, any limit measure , for a sequence of times tending to infinity, must be invariant. This result is used to show that the one-dimensional biased annihilating branching process with parameter > 1/3 converges in distribution to the upper invariant measure provided its initial configuration is almost surely finite and non-null.
In this paper we study the following general class of concurrent processing systems. There are several different classes of processors (servers) and many identical processors within each class. There is also a continuous random flow of jobs, arriving for processing at the system. Each job needs to engage concurrently several processors from various classes in order to be processed. After acquiring the needed processors the job begins to be executed. Processing is done non-preemptively, lasts for a random amount of time, and then all the processors are released simultaneously. Each job is specified by its arrival time, its processing time, and the list of processors that it needs to access simultaneously. The random flow (sequence) of jobs has a stationary and ergodic structure. There are several possible policies for scheduling the jobs on the processors for execution; it is up to the system designer to choose the scheduling policy to achieve certain objectives.
We focus on the effect that the choice of scheduling policy has on the asymptotic behavior of the system at large times and especially on its stability, under general stationary and ergocic input flows.
It is known [8] that a certain class of bond-decorated graphs exhibits multiple AB percolation phase transitions. Sufficient conditions are given under which the corresponding AB percolation critical probabilities may be identified as points of intersection of the graph of a certain polynomial with the boundary of the percolative region of an associated two-parameter bond-site percolation model on the underlying undecorated graph. The main result of the article is used to prove that the graphs in [8] exhibit multiple AB percolation critical probabilities. The possibility of identifying AB percolation critical exponents with corresponding limits for the bond-site model is discussed.
The paper deals with asymptotic stationarity of the process where is a vector in with non-negative coordinates, is an -valued process, S is a separable metric space and all operations in are meant in the coordinate-wise sense. It is shown that a type of asymptotic stationarity of (X, Y), together with some conditions, implies the same type of asymptotic stationarity of (w, X, Y). This result is applied to analyze asymptotic stationarity of multichannel queues. It may also be used to analyze asymptotic stationarity of series of multichannel queues.
Points are independently and uniformly distributed onto the unit interval. The first n—1 points subdivide the interval into n subintervals. For 1 we find a necessary and sufficient condition on {ln} for the events [Xn belongs to the ln th largest subinterval] to occur infinitely often or finitely often with probability 1. We also determine when the weak and strong laws of large numbers hold for the length of the ln th largest subinterval. The strong law of large numbers and the central limit theorem are shown to be valid for the number of times by time n the events [Xr belongs to lr th largest subinterval] occur when these events occur infinitely often.
A new approach to the problem of classification of (deflected) random walks in or Markovian models for queueing networks with identical customers is introduced. It is based on the analysis of the intrinsic dynamical system associated with the random walk. Earlier results for small dimensions are presented from this novel point of view. We give proofs of new results for higher dimensions related to the existence of a continuous invariant measure for the underlying dynamical system. Two constants are shown to be important: the free energy M < 0 corresponds to ergodicity, the Lyapounov exponent L < 0 defines recurrence. General conjectures, examples, unsolved problems and surprising connections with ergodic theory, classical dynamical systems and their random perturbations are largely presented. A useful notion naturally arises, the so-called scaled random perturbation of a dynamical system.
One expects, intuitively, that the total damage caused by an epidemic increases, in a certain sense, with the infection intensity exerted by the infectives during their lifelength. The original object of the present work is to make precise in which probabilistic terms such a statement does indeed hold true, when the spread of the disease is described by a collective Reed–Frost model and the global cost is represented by the final size and severity. Surprisingly, this problem leads us to introduce an order relation for -valued random variables, unusual in the literature, based on the descending factorial moments. Further applications of the ordering occur when comparing certain sampling procedures through the number of un-sampled individuals. In particular, it is used to reinforce slightly comparison results obtained earlier for two such samplings.