A numerical approach to cyclic-service queueing models

Queueing Systems

Volumn 6, Issue 1, 1990, Pages 173-188

  Blanc, J P C ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

epsilon algorithm; memory space; Power series algorithm; traffic intensity; waiting time

Indexed keywords

EID: 0001469733     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/BF02411472     Document Type: Article

References (13)

1. A note on waiting times in systems with queues in parallel
2. On a numerical method for calculating state probabilities for queueing systems with more than one waiting line
3. A numerical study of a coupled processor model
4. Pseudo conservation laws in cyclic-service systems
5. Waiting-time approximations in multi-queue systems with cyclic service
6. Queues served in cyclic order: waiting times
7. Power series for stationary distributions of coupled processor models
8. Multi-queue systems with non-exhaustive cyclic service
9. Average delay approximation of M/G/1 cyclic service queues with Bernoulli schedules
10. Performance evaluation of cyclic service strategies — a survey
11. On the convergence and stability of the epsilon algorithm