Application of Empirical Bayesian Estimation to the Optimal Decision of a Server-Dependent Queuing System
Application of Neuts' method to bulk queueing models with vacations
Approximation par un processus de diffusion de files GI/GI/1 avec dépendance de l'état
Aspects of Impatience in a Finite Buffer Queue
In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions of a number of performance measures are presented....
Aspects of Impatience in a Finite Buffer Queue
In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions...
Asymptotic distributions and chaos for the supermarket model.
Balance locale dans les réseaux à trois stations
Behaviour of passage time for a queueing network model with feedback: a simulation study.
Blocked network of tandem queues with withdrawal
Bounds on the throughput of an unslotted ALOHA channel in the case of a heterogeneous users' population
Brève communication. Théorème de conservation des clients dans les files d'attente
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