The discrete-time single-server queue
Queueing Systems: Theory and Applications
Polling systems with server timeouts and their application to token passing networks
IEEE/ACM Transactions on Networking (TON)
Workload and waiting time in a fixed-time loop system
Computers and Operations Research
Queueing analysis of polling models: progress in 1990-1994
Frontiers in queueing
Randomly timed gated queueing systems
SIAM Journal on Applied Mathematics
Two Queues with Alternating Service Periods
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Research: Analysis of a time-limited polling system
Computer Communications
| Hi-index | 0.00 |
This paper considers polling systems with an autonomous server that remains at a queue for an exponential amount of time before moving to a next queue incurring a generally distributed switch-over time. The server remains at a queue until the exponential visit time expires, also when the queue becomes empty. If the queue is not empty when the visit time expires, service is preempted upon server departure, and repeated when the server returns to the queue. The paper first presents a necessary and sufficient condition for stability, and subsequently analyzes the joint queue-length distribution via an embedded Markov chain approach. As the autonomous exponential visit times may seem to result in a system that closely resembles a system of independent queues, we explicitly investigate the approximation of our system via a system of independent vacation queues. This approximation is accurate for short visit times only.