Computation of the limiting distribution in queueing systems with repeated attempts and disasters
Computation of the limiting distribution in queueing systems with repeated attempts and disasters
Single server queues with repeated attempts are useful in the modeling of computer and telecommunication systems. In addition, we consider in this paper the possibility of disasters. When a disaster occurs, all the customers present in the system are destroyed immediately. Using a regenerative approach, we derive a numerically stable recursion scheme for the state probabilities. This model can be employed to analyze the behaviour of a buffer in computers with virus infections.
Computational procedures for a class of GI/D/ systems in discrete time.
Computational schemes for two exponential servers where the first has a finite buffer
We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [Stochastic Models20 (2004) 149–172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process to...
Computational schemes for two exponential servers where the first has a finite buffer
We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [Stochastic Models20 (2004) 149–172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process to...
Conditional limit theorems for intermediately subcritical branching processes in random environment
For a branching process in random environment it is assumed that the offspring distribution of the individuals varies in a random fashion, independently from one generation to the other. For the subcritical regime a kind of phase transition appears. In this paper we study the intermediately subcritical case, which constitutes the borderline within this phase transition. We study the asymptotic behavior of the survival probability. Next the size of the population and the shape of the random environment...
Confinement of the two dimensional discrete Gaussian free field between two hard walls.
Connectivity bounds for the vacant set of random interlacements
The model of random interlacements on ℤd, d≥3, was recently introduced in [Vacant set of random interlacements and percolation. Available at http://www.math.ethz.ch/u/sznitman/preprints]. A non-negative parameter u parametrizes the density of random interlacements on ℤd. In the present note we investigate connectivity properties of the vacant set left by random interlacements at level u, in the non-percolative regime u>u∗, with u∗ the non-degenerate critical parameter for the percolation...
Conservation methods in queuing theory
Constant rate distributions on partially ordered sets.
Constructing quantum dissipations and their reversible states from classical interacting spin systems
Construction of a class of stationary processes with applications in reliability
Contributions to the renewal theory of the things in operation [Abstract of thesis]
Contrôle dynamique de flux dans un système d'attente avec panne
Contrôle dynamique de flux dans un système d'attente avec panne
We consider two parallel M/M/1 queues. The server at one of the queues is subject to intermittent breakdowns. By the theory of dynamic programming, we determine a threshold optimal policy which consists to transfer, when it is necessary, the customers that arrive at the first queue towards the second queue in order to minimize an instantaneous cost depending of the two queue lengths.
Controlling Griffiths' singularities
Convergence diagnosis to stationary distribution in MCMC methods via atoms and renewal sets
Convergence géométrique pour la file M/H/1
Convergence of a “Gibbs-Boltzmann” random measure for a typed branching diffusion
Convergence of coalescing nonsimple random walks to the Brownian web.