Exact results for the cyclic-service queue with a Bernoulli schedule
Performance Evaluation
Workloads and waiting times in single-server systems with multiple customer classes
Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
Stability of token passing rings
Queueing Systems: Theory and Applications - Polling models
Stability, monotonicity and invariant quantities in general polling systems
Queueing Systems: Theory and Applications - Polling models
Queueing analysis of polling models: progress in 1990-1994
Frontiers in queueing
Performance Evaluation of Cyclic Service Strategies - A Survey
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Optimization of Polling Systems
Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
| Hi-index | 0.09 |
We consider a cyclic-service queueing system (polling system) with time-limited service, in which the length of a service period for each queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then proceeds to the next queue. The customer whose service is interrupted due to the timer expiration is attended according to the nonpreemptive service discipline. For the cyclic-service system with structured batch Poisson arrivals (M^x/G/1) and an exponential timer, we derive a pseudoconservation law and an exact mean waiting time formula for the symmetric system.