The paper presents a detailed study of a computer processing queueing system which has a binomial input, multiple exponential servers and first-come first-served queue discipline. In the paper, a new formula is derived for the determination of the waiting time distribution in the system. Numerical computation is illustrated by an example, where the system state probabilities and the waiting time distribution are obtained
A good telecommunication networks can be represented as queueing networks with state-dependent arriv...
We study a queueing network with a single shared server that serves the queues in a cyclic order. Ex...
AbstractIn this paper, we consider a queueing system with postservice activity. During the time when...
The paper presents a detailed study of a computer processing queueing system which has a binomial in...
The paper investigates a multiserver queueing system with feedback and a computer used as an informa...
AbstractA queueing theory model is described which serves as a management tool for evaluating the se...
The problem which the thesis discusses is that of determining the probability of delay of a demand (...
Queueing systems with processor sharing represent the adequate models for sharing the resources, e.g...
AbstractIn this paper, a discrete-time multiserver queueing system with infinite buffer size is stud...
In this paper we present a numerical method for the queue GI/H2/s, which is based on general results...
summary:The aim of the paper is to investigate queueing systems of the type $M/Mn$ (in equilibrium) ...
This thesis extends the application of waiting line theory to situations where both arrival rate and...
AbstractA number of time-shared systems have recently been analyzed in the literature with methods f...
The problem considered in this thesis is that of finding the probability distribution of waiting tim...
In queueing theory, the study of $//1$ systems is particularly relevant due to the fact that until n...
A good telecommunication networks can be represented as queueing networks with state-dependent arriv...
We study a queueing network with a single shared server that serves the queues in a cyclic order. Ex...
AbstractIn this paper, we consider a queueing system with postservice activity. During the time when...
The paper presents a detailed study of a computer processing queueing system which has a binomial in...
The paper investigates a multiserver queueing system with feedback and a computer used as an informa...
AbstractA queueing theory model is described which serves as a management tool for evaluating the se...
The problem which the thesis discusses is that of determining the probability of delay of a demand (...
Queueing systems with processor sharing represent the adequate models for sharing the resources, e.g...
AbstractIn this paper, a discrete-time multiserver queueing system with infinite buffer size is stud...
In this paper we present a numerical method for the queue GI/H2/s, which is based on general results...
summary:The aim of the paper is to investigate queueing systems of the type $M/Mn$ (in equilibrium) ...
This thesis extends the application of waiting line theory to situations where both arrival rate and...
AbstractA number of time-shared systems have recently been analyzed in the literature with methods f...
The problem considered in this thesis is that of finding the probability distribution of waiting tim...
In queueing theory, the study of $//1$ systems is particularly relevant due to the fact that until n...
A good telecommunication networks can be represented as queueing networks with state-dependent arriv...
We study a queueing network with a single shared server that serves the queues in a cyclic order. Ex...
AbstractIn this paper, we consider a queueing system with postservice activity. During the time when...