On open problems in polling systems

DOI10.1007/S11134-011-9247-9MaRDI QIDQ383211zbMATH OpenOpenAlexFDO

Authors Onno Boxma, Erik M. M. Winands, Marko A. A. Boon

Publication date 25 November 2013

Published in Queueing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://arxiv.org/abs/1408.0142

zbMATH Keywords

pollingbranching-classgatedone-limitedswitch-over time asymptotics

Mathematics Subject Classification ID

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

Abstract: In the present paper we address two open problems concerning polling systems, viz., queueing systems consisting of multiple queues attended by a single server that visits the queues one at a time. The first open problem deals with a system consisting of two queues, one of which has gated service, while the other receives 1-limited service. The second open problem concerns polling systems with general (renewal) arrivals and deterministic switch-over times that become infinitely large. We discuss related, known results for both problems, and the difficulties encountered when trying to solve them.

Recommendations

• Polling: past, present, and perspective
• Publication:4865613
• Comments on: ``Polling: past, present and perspective
• scientific article; zbMATH DE number 19790
• scientific article; zbMATH DE number 994725

Cites work

• scientific article; zbMATH DE number 3890413 (Why is no real title available?)
• scientific article; zbMATH DE number 3814724 (Why is no real title available?)
• scientific article; zbMATH DE number 805121 (Why is no real title available?)
• scientific article; zbMATH DE number 3227290 (Why is no real title available?)
• A STATE-DEPENDENT POLLING MODEL WITH k-LIMITED SERVICE
• A queueing model with applications to bridges and the DQDB (IEEE 802.6) MAN
• A two-queue model with exhaustive and limited service disciplines
• Analysis of a two-queue model with Bernoulli schedules
• Analysis of polling systems with mixed service disciplines
• Branching-type polling systems with large setups
• Delay in polling systems with large switch-over times
• Limit theorems for polling models with increasing setups.
• Mathematical methods to study the polling systems
• On polling systems with large setups
• Polling Models With and Without Switchover Times
• Polling systems and multitype branching processes
• Queuing analysis of polling models
• Towards a unifying theory on branching-type polling systems in heavy traffic
• Two Queues Attended by a Single Server
• Workloads and waiting times in single-server systems with multiple customer classes

Cited in

(9)

• Comments on: ``Polling: past, present and perspective
• On Elevator polling with globally gated regime
• A discrete model of a large polling system
• Open problems in queueing theory inspired by datacenter computing
• Comments on: ``Polling: past, present and perspective
• Polling: past, present, and perspective
• Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times
• scientific article; zbMATH DE number 19790 (Why is no real title available?)
• Belated analyses of three credit-based adaptive polling algorithms

This page was built for publication: On open problems in polling systems

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