Efficient visit frequencies for polling tables: Minimization of waiting cost

DOI10.1007/BF01158795zbMath0738.68008MaRDI QIDQ1176444

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

Publication date: 25 June 1992

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

mean waiting timesminimization of waiting costmodeling and analysis of communication systemspolling table

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

ON THE OPTIMAL OPEN-LOOP CONTROL POLICY FOR DETERMINISTIC AND EXPONENTIAL POLLING SYSTEMS, WAIT-AND-SEE STRATEGIES IN POLLING MODELS, Approximating queue size and waiting time distributions in general polling systems, Optimal routeing in two-queue polling systems, Stochastic scheduling of parallel queues with set-up costs, Dynamic control of a flexible server in an assembly-type queue with setup costs, Designs of optimal switching feedback decentralized control policies for fluid queueing networks, Mathematical methods to study the polling systems, Queueing models of certain manufacturing cells under product-mix sequencing rules, Polling models with multi-phase gated service, Admission policies for the customized stochastic lot scheduling problem with strict due-dates, A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups, Pseudo-cyclic policies for multi-queue single server systems, Optimization of static traffic allocation policies

Cites Work

• Unnamed Item
• A numerical approach to cyclic-service queueing models
• Workloads and waiting times in single-server systems with multiple customer classes
• Pseudo-conservation laws in cyclic-service systems
• The power-series algorithm applied to cyclic polling systems
• Efficient visit orders for polling systems
• Queues with Periodic Service and Changeover Time