Pseudo-cyclic policies for multi-queue single server systems

DOI10.1007/BF02023096MaRDI QIDQ1315338zbMATH OpenOpenAlexFDO

Authors Offer Fabian, Hanoch Levy

Publication date 10 March 1994

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02023096

zbMATH Keywords

stochastic dominancecycle-time guided algorithmssemi-dynamic polling modelswaiting time performance

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Communication networks in operations research (90B18)

Recommendations

• Dynamic priority rules for cyclic-type queues
• Dynamic visit-order rules for batch-service polling
• scientific article; zbMATH DE number 19794
• On optimal polling policies

Cites work

• scientific article; zbMATH DE number 4055548 (Why is no real title available?)
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• Dominance relations in polling systems
• Dynamic priority rules for cyclic-type queues
• Efficient visit frequencies for polling tables: Minimization of waiting cost
• On optimal polling policies
• On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
• On the Optimal Control of Two Queues with Server Setup Times and Its Analysis

Cited in

(6)

• Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
• Mathematical methods to study the polling systems
• Polling: past, present, and perspective
• Dynamic priority rules for cyclic-type queues
• A simple policy for multiple queues with size-independent service times
• Pseudo-conservation laws in cyclic-service systems

This page was built for publication: Pseudo-cyclic policies for multi-queue single server systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315338)