Polling: past, present, and perspective
From MaRDI portal
Publication:1617103
DOI10.1007/s11750-018-0484-5zbMath1401.60166OpenAlexW2889794690WikidataQ129298268 ScholiaQ129298268MaRDI QIDQ1617103
Publication date: 7 November 2018
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-018-0484-5
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (8)
Study of Birth-Death Processes with Immigration ⋮ Workload analysis of a two-queue fluid polling model ⋮ Transient analysis for exponential time-limited polling models under the preemptive repeat random policy ⋮ Analysis of polling models with a self-ruling server ⋮ Investigation of the stochastic polling system and its applications to broadband wireless networks ⋮ Stochastic decompositions in bivariate risk and queueing models with mutual assistance ⋮ Two queues with time-limited polling and workload-dependent service speeds ⋮ Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times
Cites Work
- L\'evy-driven polling systems and continuous-state branching processes
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
- M/G/∞ POLLING SYSTEMS WITH RANDOM VISIT TIMES
- Stochastic branching processes with continuous state space
- Queues Served in Cyclic Order
- Queues Served in Cyclic Order: Waiting Times
- On the relation between customer and time averages in queues
- Queues with Periodic Service and Changeover Time
- The multitype Galton-Watson process with ρ near 1
- A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive
- Approximations for the waiting time distribution in polling models with and without state-dependent setups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic scheduling with reconfiguration delays
- The shorter queue polling model
- Another look into decomposition results
- Stability and performance of greedy server systems
- On open problems in polling systems
- Sojourn times in a processor sharing queue with multiple vacations
- Queue lengths and workloads in polling systems
- Finite-buffer polling systems with threshold-based switching policy
- A two-queue polling model with two priority levels in the first queue
- Decomposition results for stochastic storage processes and queues with alternating Lévy inputs
- Expected waiting times in polling systems under priority disciplines
- Unified analysis of \(BMAP/G/1\) cyclic polling models
- Reduction of a polling network to a single node
- A note on polling models with renewal arrivals and nonzero switch-over times
- Dynamic scheduling for switched processing systems with substantial service-mode switching times
- A polling model with an autonomous server
- Queueing systems with vacations - a survey
- Comparison theorems and ergodic properties of polling systems.
- On Elevator polling with globally gated regime
- A decomposition result for a class of polling models
- A queueing network with a single cyclically roving server
- A note on the pseudo-conservation law for a multi-queue with local priority
- Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
- Dynamic priority rules when polling with multiple parallel servers
- A continuous polling system with general service times
- On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
- Dynamic server assignment in a two-queue model
- A two-queue model with Bernoulli service schedule and switching times
- Pseudo-cyclic policies for multi-queue single server systems
- Monotonicity and stability of periodic polling models
- Single-server queues with spatially distributed arrivals
- Approximating queue size and waiting time distributions in general polling systems
- The polling system with a stopping server
- On polling systems with infinitely many stations
- Polling on a space with general arrival and service time distribution
- Assigning a single server to inhomogeneous queues with switching costs
- Queueing dynamics and maximal throughput scheduling in switched processing systems
- Performance analysis of polling systems with retrials and glue periods
- Queue-length balance equations in multiclass multiserver queues and their generalizations
- Continuous polling models and application to ferry assisted WLAN
- Gated polling systems with Lévy inflow and inter-dependent switchover times: A dynamical-systems approach
- A stability criterion via fluid limits and its application to a polling system
- Workloads and waiting times in single-server systems with multiple customer classes
- Polling systems with periodic server routing in heavy traffic: renewal arrivals
- Relating polling models with zero and nonzero switchover times
- Polling systems with zero switchover times: A heavy-traffic averaging principle
- Polling systems with multiple coupled servers
- Stability of polling systems with exhaustive service policies and state-dependent routing
- The impact of scheduling policies on the waiting-time distributions in polling systems
- Mixed gated/exhaustive service in a polling model with priorities
- Fluid polling systems
- Queues and Lévy fluctuation theory
- Polling systems and multitype branching processes
- The analysis of batch sojourn-times in polling systems
- On the stability of a queueing system with uncountably branching fluid limits
- Expected waiting time in symmetric polling systems with correlated walking times
- Mathematical methods to study the polling systems
- Towards a unifying theory on branching-type polling systems in heavy traffic
- From polling to snowplowing
- Vacation queueing models. Theory and applications
- The distributional form of Little's law and the Fuhrmann-Cooper decomposition
- Polling Systems in Heavy Traffic: A Bessel Process Limit
- Heavy Traffic Analysis of Polling Systems in Tandem
- Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
- Optimization of polling systems with Bernoulli schedules
- Averaging Principles for a Diffusion-Scaled, Heavy-Traffic Polling Station with K Job Classes
- The cμ rule revisited
- Gated, Exhaustive, Parallel Service
- Analysis of polling systems with mixed service disciplines
- A STATE-DEPENDENT POLLING MODEL WITH k-LIMITED SERVICE
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- Pseudo-conservation laws in cyclic-service systems
- Analysis of cyclic service systems with limited service: Bounds and approximations
- Waiting-time approximations in multi-queue systems with cyclic service
- Dynamic priority rules for cyclic-type queues
- The power-series algorithm applied to cyclic polling systems
- Mean waiting time approximations in cyclic-service systems with exhaustive limited service policy
- Polling systems with zero switch-over periods: a general method for analyzing the expected delay
- Two Queues with Alternating Service
- Polling systems with permanent and transient jobs
- Efficient visit orders for polling systems
- Computing distributions and moments in polling models by numerical transform inversion
- Analysis of a two-queue model with Bernoulli schedules
- Analysis of multiple-server polling systems by means of the power-series algorithm
- Polling Models With and Without Switchover Times
- Heavy traffic analysis for continuous polling models
- Multiclass Queueing Systems in Heavy Traffic: An Asymptotic Approach Based on Distributional and Conservation Laws
- PERFORMANCE ANALYSIS OF A TWO-QUEUE MODEL WITH AN (M,N)-THRESHOLD SERVICE SCHEDULE
- On the Optimal Control of Two Queues with Server Setup Times and Its Analysis
- Waiting times in a two-queue model with exhaustive and Bernoulli service
- Parallel Service with Vacations
- On the Stability of Greedy Polling Systems with General Service Policies
- Heavy traffic analysis of roving server networks
This page was built for publication: Polling: past, present, and perspective
