Efficient visit orders for polling systems

DOI10.1016/0166-5316(93)90031-OzbMath0781.68030OpenAlexW2130225127MaRDI QIDQ4272460

Hanoch Levy, J. A. Weststrate, Onno J. Boxma

Publication date: 20 December 1993

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(93)90031-o

zbMATH Keywords

polling tablerandom pollingmean workload minimization

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (12)

Polling: past, present, and perspective ⋮ Quasi-fixed cyclic production schemes for multiple products with stochastic demand ⋮ On competitive analysis for polling systems ⋮ On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing ⋮ Efficient visit frequencies for polling tables: Minimization of waiting cost ⋮ Mathematical methods to study the polling systems ⋮ Cyclic reservation schemes for efficient operation of multiple-queue single-server systems ⋮ Performance analysis and optimization of a cyclic-service tandem queueing system with multi-class customers ⋮ A pseudoconservation law for a time-limited service polling system with structured batch Poisson arrivals ⋮ Fluid polling systems ⋮ A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups ⋮ Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques

This page was built for publication: Efficient visit orders for polling systems