Analysis of polling systems
Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
Waiting-time approximations for cyclic-service systems with switchover times
Performance Evaluation
Analysis of cyclic service systems with limited service: bounds and approximations
Performance Evaluation
Performance Evaluation of Cyclic Service Strategies - A Survey
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
New Message Waiting Time in a Symmetric Polling System
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Customer Routing on Polling Systems
Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
| Hi-index | 0.00 |
In this paper, we examine a problem which is an extension of the limited service in a queueing system with a cyclic server. In this service mechanism, each queue, after receiving service in cycle j, makes a reservation for its service requirement in cycle j + 1. In this paper, we consider symmetric case only, i.e., the arrival rates to all the queues are the same. The main contribution to queueing theory is that we propose an approximation for the queue length and sojourn-time distributions for this discipline. Most approximate studies on cyclic queues, which have been considered before, examine the means only. Our method is an iterative one, which we prove to be convergent by using stochastic dominance arguments. We examine the performance of our algorithm by comparing it to simulations and show that the results are very good.