Consider a closed cyclic queuing system consisting of M exponential queues. The Laplace-Stieltjes transform of the joint distribution of the consecutive sojourn times of a customer at the M queues is determined and shown to have a product form. The proof is based on a reversibility argument
We present an extension of the arrival theorem for the output process from a node in closed Markovia...
We consider a polling system of N queues Q1,…,QN, cyclically visited by a single server. Customers a...
In many modern computer-communication systems, a job may be processed in several phases, or a job ma...
In this paper we consider an M/G/1 queueing model, in which each customer is fed back a fixed number...
From a customer's point of view, the most important performance measure in a queueing network is his...
textabstractWe show for the M/G/1 processor sharing queue that the service time distribution is regu...
We consider a closed queueing network, consisting of two FCFS single server queues in series: a queu...
This paper studies the M/G/1 processor-sharing (PS) queue, in particular the sojourn time distributi...
For the M/G/1 queue we study the joint distribution of the number of customers x present immediately...
We consider a closed queueing network, consisting of two FCFS single server queues in series: a queu...
AbstractLet Y={Yt:t⩾0} be a semi-Markov process whose state space S is finite. Assume that Y is eith...
We present an extension of the arrival theorem for the output process from a node in closed Markovia...
We consider a polling system of N queues Q1,…,QN, cyclically visited by a single server. Customers a...
In many modern computer-communication systems, a job may be processed in several phases, or a job ma...
In this paper we consider an M/G/1 queueing model, in which each customer is fed back a fixed number...
From a customer's point of view, the most important performance measure in a queueing network is his...
textabstractWe show for the M/G/1 processor sharing queue that the service time distribution is regu...
We consider a closed queueing network, consisting of two FCFS single server queues in series: a queu...
This paper studies the M/G/1 processor-sharing (PS) queue, in particular the sojourn time distributi...
For the M/G/1 queue we study the joint distribution of the number of customers x present immediately...
We consider a closed queueing network, consisting of two FCFS single server queues in series: a queu...
AbstractLet Y={Yt:t⩾0} be a semi-Markov process whose state space S is finite. Assume that Y is eith...
We present an extension of the arrival theorem for the output process from a node in closed Markovia...
We consider a polling system of N queues Q1,…,QN, cyclically visited by a single server. Customers a...
In many modern computer-communication systems, a job may be processed in several phases, or a job ma...
DOI
Add to ORKG