scholarly journals The Round-Robin Service Discipline in Discrete Time for Phase-Type Distributed Packet-Lengths

Author(s):  
K. Laevens
1984 ◽  
Vol 16 (1) ◽  
pp. 202-213 ◽  
Author(s):  
R. Schassberger

The M/G/1 processor-sharing queue is studied by way of an approximating sequence of models featuring a round-robin discipline and operating in discrete time. In particular, residence-time distributions of jobs are derived.


1984 ◽  
Vol 16 (01) ◽  
pp. 202-213 ◽  
Author(s):  
R. Schassberger

The M/G/1 processor-sharing queue is studied by way of an approximating sequence of models featuring a round-robin discipline and operating in discrete time. In particular, residence-time distributions of jobs are derived.


2016 ◽  
Vol 26 (2) ◽  
pp. 379-390 ◽  
Author(s):  
Ivan Atencia

Abstract This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS) service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability generating function approach, steady-state performance measures such as the first moments of the busy period of the queue content and of customers delay are obtained. Finally, some numerical examples to show the influence of the parameters on several performance characteristics are given.


2013 ◽  
Vol 49 (4) ◽  
pp. 578-583
Author(s):  
I. N. Kovalenko ◽  
E. V. Koba ◽  
O. N. Dyshliuk

Sign in / Sign up

Export Citation Format

Share Document