Analysis of polling systems
The analysis of random polling systems
Operations Research
Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Efficient visit orders for polling systems
Performance Evaluation
Polling systems with station breakdowns
Performance Evaluation
Analysis and Control of Poling Systems
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Waiting Times in Polling Systems with Markovian Server Routing
Messung, Modellierung und Bewertung von Rechensystemen, 5. GI/ITG-Fachtagung
DYNAMIC VISIT-ORDER RULES FOR BATCH-SERVICE POLLING
Probability in the Engineering and Informational Sciences
Analysis of a TCP system under polling-type reduction-signal procedures
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
A fluid queue modulated by two independent birth-death processes
Computers & Mathematics with Applications
Orchestrating parallel TCP connections: Cyclic and probabilistic polling policies
Performance Evaluation
| Hi-index | 0.00 |
We study N-queues single-server fluid polling systems, where a fluid is continuously flowing into the queues at queue-dependent rates. When visiting and serving a queue, the server reduces the amount of fluid in the queue at a queue-dependent rate. Switching from queue i to queue j requires two random-duration steps: (i) departing queue i, and (ii) reaching queue j. The length of time the server resides in a queue depends on the service regime. We consider three main regimes: Exhaustive, Gated, and Globally-Gated. Two polling procedures are analyzed: (i) cyclic and (ii) probabilistic. Under steady-state, we derive the Laplace---Stieltjes transform (LST), mean, and second moment of the amount of flow at each queue at polling instants, as well as at an arbitrary moment. We further calculate the LST and mean of the "waiting time" of a drop at each queue and derive expressions for the mean total load in the system for the various service regimes. Finally, we explore optimal switching procedures.