Comments on a single server queue.
Comparaison des disciplines de service des files d'attente G/G/1
Complete analysis of MAP/G/1/N queue with single (multiple) vacation(s) under limited service discipline.
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...
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.
Convergence géométrique pour la file M/H/1
Correlations in output and overflow traffic processes in simple queues.
Cost analysis of a queueing system with two service facilities
Cycle time of stochastic max-plus linear systems.
Delay analysis of an priority queueing system with push-out scheme.
Diffusion approximation for a controlled service system
Diffusion approximation for first overflow time in system with finite capacity.
Dobrushin's approach to queueing network theory.
Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning.
Economic analysis of production bottlenecks.