This paper is concerned with the stability of a preemptive repeat priority queueing system with multiple types of customers and customer transfers between queues. Using the mean-drift method and matrix-analytic methods, simple conditions for the queueing system to be stable or instable are found. The conditions indicate that system stability depends only on the service rate of customers of the ...

––This paper deals with the Queueing theory and the analysis of the efficiency of the queueing system of a bank in different locations. Starting with the historical back ground and important concepts of the queueing theory, we measured the effectiveness of banks in rural and town areas by using probability curves of arrivals and waiting times.

The classical Erlang and Engset loss models have been used extensively in the traffic engineering of traditional telephone exchanges. More recently, these models have been generalized to the so-called loss networks, which provide models for resource sharing in multiservice telecommunication networks. In this paper, we introduce a new generalized class of models, queueing-loss networks, which ca...

The theory of queueing systems is traditionally considered as a branch of applied probability. Hence the toolkit used in the analysis of queueing system draws heavily on the theory of stochastic processes. Many problems in the area of queueing networks, however, are of algorithmic nature, and thus require algorithmic/complexity theoretic approaches. In this tutorial we will discuss several such...

This paper is devoted to the study of an M/G/1 queue with a particular vacation discipline. The server is due to take a vacation as soon as it has served exactly N customers since the end of the previous vacation. N may be either a constant or a random variable. If the system becomes empty before the server has served N customers, then it stays idle until the next customer arrival. Such a vacat...

This paper proposes a performance evaluation model for e ective job scheduling in global computing systems. The proposed model represents a global computing system by a queueing network, in which servers and networks are represented by queueing systems. Evaluation of the proposed model showed that the model could simulate behavior of an actual global computing system and job scheduling on the s...

In this investigation, Jackson queueing network has been widely used to model and analyze the performance of complex parallel systems. M/G/1 queueing system is used to model a parallel processing system, which is expandable in vertical and horizontal manner. Determine a closed form solution for the system performance metrics, such as processor’s waiting time, system processing power, etc.

A closed cyclic queueing system with multiple classes is analyzed numerically. The queueing system was originally motivated by a need to model circuit switching traffic in a data multiplexing scheme which provides both circuit and switching capabilities. The queueing system consists of two nodes, namely the primary and the secondary node. Customers in the primary node may require a random numbe...

In most queueing systems the server may be subjected to lengthy and unpredictable breakdowns while serving a customer. For instance, in manufacturing systems the machine may breakdown due to malfunction or job related problems; in computer systems, the machine may be subject to scheduled backups and predicted failures. In these systems, server breakdown results in a period of server unavailabil...

Keywords: Queueing Tandem queueing system Marked Markovian arrival process Phase-type distribution Laplace–Stieltjes transform a b s t r a c t A tandem queueing system with infinite and finite intermediate buffers, heterogeneous customers and generalized phase-type service time distribution at the second stage is investigated. The first stage of the tandem has a finite number of servers without...