Analysis of polling systems
On the optimal control of two queues with server setup times and its analysis
SIAM Journal on Computing
Queuing analysis of polling models
ACM Computing Surveys (CSUR)
Alternating service queues with mixed exhaustive and K-limited services
Performance Evaluation
Randomly timed gated queueing systems
SIAM Journal on Applied Mathematics
A two-queue model with Bernoulli service schedule and switching times
Queueing Systems: Theory and Applications
A Two-Queue Polling Model with a Threshold Service Policy
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Analysis and Control of Poling Systems
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Analysis of a nonpreemptive priority queue with exponential timer and server vacations
Performance Evaluation
Level-crossing approach to a time-limited service system with two types of vacations
Operations Research Letters
| Hi-index | 0.00 |
Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time the server resides in the secondary queue is determined by the dynamic evolution in queue 1. If there is an arrival to queue 1 while the server is still working in queue 0, the latter is immediately gated, and the server completes service there only to the gated jobs, upon which it switches back to the primary queue. We formulate this system as a two-queue polling model with a single alternating server and with randomly-timed gated (RTG) service discipline in queue 0, where the timer there depends on the arrival stream to the primary queue. We derive Laplace–Stieltjes transforms and generating functions for various key variables and calculate numerous performance measures such as mean queue sizes at polling instants and at an arbitrary moment, mean busy period duration and mean cycle time length, expected number of messages transmitted during a busy period and mean waiting times. Finally, we present graphs of numerical results comparing the mean waiting times in the two queues as functions of the relative loads, showing the effect of the RTG regime.