We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.

This paper deals with a multi-class priority queueing system with customer transfers that occur only from lower priority queues to higher priority queues. Conditions for the queueing system to be stable/unstable are obtained. An auxiliary queueing system is introduced, for which an explicit product-form solution is found for the stationary distribution of queue lengths. Sample path relationship...

  Since late 1960's, the emergency location problems, fire stations and medical emergency services have attracted the attention of researchers. Mathematical models, both deterministic and probabilistic, have been proposed and applied to find suitable locations for such facilities in many urban and rural areas. Here, we review some models proposed for finding the location of such facilities, wit...

Queueing theory offers a large variety of techniques that can be used in performance modelling of computer systems and data communication networks. The diversity of assumptions causes that the numerical results, obtained for the same system but by means of different techniques, can often be numerically very different. The project is aimed at finding common denominators for numerical results obt...

Queueing Systems with Customer Abandonments and Retrials by Song Deng Doctor of Philosophy in Engineering Industrial Engineering & Operations Research University of California, Berkeley Assistant Professor Ying-Ju Chen , Co-chair Professor Zuo-Jun “Max” Shen , Co-chair In queueing theory, the phenomenon that customers get impatient and renege from the system when the waiting time exceeds their ...

In this paper, we consider a discrete-time multiserver queueing system with infinite buffer size, geometric service times and a FCFS (first-come-first-served) queueing discipline. A relationship between the probability distributions of the system contents and the packet delay is established. The relationship is general in the sense that it doesn’t require knowledge of the exact nature of the ar...