Dynamic visit-order rules for batch-service polling

DOI10.1017/S0269964803173044MaRDI QIDQ2808339zbMATH OpenOpenAlexFDO

Authors Jan van der Wal, Uri Yechiali

Publication date 23 May 2016

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0269964803173044

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• Efficient visit orders for polling systems
• Analysis of a batch service multi-server polling system with dynamic service control
• Dynamic priority rules when polling with multiple parallel servers
• Polling systems with periodic server routing in heavy traffic
• Polling systems with batch service
• scientific article; zbMATH DE number 977757
• Analysis of a batch service polling system in a multi-phase random environment
• scientific article; zbMATH DE number 1779435

Cited in

(26)

• Efficient visit frequencies for polling tables: Minimization of waiting cost
• Dynamic priority rules when polling with multiple parallel servers
• Pseudo-cyclic policies for multi-queue single server systems
• Analysis of a batch service polling system in a multi-phase random environment
• Tail asymptotics for a batch service polling system with retrials and nonpersistent customers
• Analysis of a batch service multi-server polling system with dynamic service control
• Exact tail asymptotics for the Israeli queue with retrials and non-persistent customers
• The Israeli queue with a general group-joining policy
• On fairness in polling systems
• Strategic behavior of customers and optimal control for batch service polling systems with priorities
• System occupancy in a multiclass batch-service queueing system with limited variable service capacity
• Fluid polling systems
• Mathematical methods to study the polling systems
• The Israeli Queue with priorities
• Polling with Batch Service
• Dynamic priority rules for cyclic-type queues
• scientific article; zbMATH DE number 19794 (Why is no real title available?)
• Efficient visit orders for polling systems
• scientific article; zbMATH DE number 977757 (Why is no real title available?)
• Polling systems with batch service
• Optimal routeing in two-queue polling systems
• The Israeli queue with retrials
• Polling, Greedy and Horizon Servers on a Circle
• THE ISRAELI QUEUE WITH INFINITE NUMBER OF GROUPS
• Analysis of the scheduling mechanism for virtualization of links with partial isolation
• Discrete-time informal queue with an infinite number of groups for resource management of a data center

This page was built for publication: Dynamic visit-order rules for batch-service polling

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