Blocked network of tandem queues with withdrawal
Boundedness on stochastic Petri nets.
Stochastic Petri nets generalize the notion of queuing systems and are a useful model in performance evaluation of parallel and distributed systems. We give necessary and sufficient conditions for the boundedness of a stochastic process related to these nets.
Brèves communications. Une démonstration directe de la formule de Pollaczek-Khintchine
Bulk input queues with quorum and multiple vacations.
Busy period analysis, rare events and transient behavior in fluid flow models.
Busy period problems in the GI/G/∞ queue
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.
Complex-analytic and matrix-analytic solutions for a queueing system with group service controlled by arrivals.
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.