Calculation of steady-state probabilities of M/M queues: Further approaches.
Cálculo del número medio de máquinas activas en un grupo de un operario y N máquinas, con incidencias poissonianas y tiempos de servicio aleatorio.
Este artículo expone un método para el cálculo del número medio de máquinas en funcionamiento en un sistema formado por un operario y N máquinas iguales, con tiempos exponenciales de funcionamiento entre averías y tiempos de servicio aleatorios, idéntica e independientemente distribuidos. El modelo generaliza las conocidas fórmulas que se obtienen a partir de los modelos M/M/1 con centro emisor finito y de Ashcroft, que suelen utilizarse para el problema de asignación de máquinas.
Characterization of the departure process from an ME/ME/1 queue
In this paper we propose a family of finite approximations for the departure process of an ME/ME/1 queue indexed by a parameter defined as the system size of the finite approximation. The approximations capture the interdeparture times from an ME/ME/1 queue exactly and preserve the lag correlations of inter-event times of the departures from an ME/ME/1 queue up to lag .
Characterization of the departure process from an ME/ME/1 queue
In this paper we propose a family of finite approximations for the departure process of an ME/ME/1 queue indexed by a parameter k defined as the system size of the finite approximation. The approximations capture the interdeparture times from an ME/ME/1 queue exactly and preserve the lag correlations of inter-event times of the departures from an ME/ME/1 queue up to lag (k - 1).
Charge stationnaire d'une file d'attente à rejet. Application au cas indépendant
Charge stationnaire d'une file d'attente à rejet. Cas de plusieurs serveurs
Charges stationnaires d'une file d'attente avec blocages
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