Applications of polling systems

Abstract

Since the first paper on polling systems, written by Mack in 1957, a huge number of papers on this topic has been written. A typical polling system consists of a number of queues, attended by a single server. In several surveys, the most notable ones written by Takagi, detailed and comprehensive descriptions of the mathematical analysis of polling systems are provided. The goal of the present survey paper is to complement these papers by putting the emphasis on \emph{applications} of polling models. We discuss not only the capabilities, but also the limitations of polling models in representing various applications. The present survey is directed at both academicians and practitioners.

References in corpus (5)

• Closed-Form Waiting Time Approximations for Polling Systems
• A Polling Model with Multiple Priority Levels
• A two-station queue with dependent preparation and service times
• Mixed Gated/Exhaustive Service in a Polling Model with Priorities
• M/G/$\infty$ polling systems with random visit times

Cited by in corpus (12)

• Queue lengths and workloads in polling systems
• Delays at signalised intersections with exhaustive traffic control
• Platoon Forming Algorithms for Intelligent Street Intersections
• On Competitive Analysis for Polling Systems
• Queueing networks with a single shared server: light and heavy traffic
• Heavy traffic analysis of roving server networks
• Asymptotic Optimality of the Binomial-Exhaustive Policy for Polling Systems with Large Switchover Times
• Stability of Polling Systems for a Large Class of Markovian Switching Policies
• Batch sojourn time in polling systems on a circle
• Existence and Approximations of Moments for Polling Systems under the Binomial-Exhaustive Policy
• Asymptotic Properties of a Branching-type Overloaded Polling Network
• Two queues with random time-limited polling