The impact of scheduling policies on the waiting-time distributions in polling systems
From MaRDI portal
Publication:2018945
Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Laplace transform (44A10) Numerical methods for integral transforms (65R10) Stochastic scheduling theory in operations research (90B36)
Recommendations
- Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
- Approximations for the waiting time distribution in polling models with and without state-dependent setups
- Waiting-time distributions in polling systems with simultaneous batch arrivals
- Analysis of finite-capacity polling systems
- Distribution of the delay in polling systems in heavy traffic
Cites work
- scientific article; zbMATH DE number 994725 (Why is no real title available?)
- scientific article; zbMATH DE number 3147953 (Why is no real title available?)
- scientific article; zbMATH DE number 3147954 (Why is no real title available?)
- scientific article; zbMATH DE number 805121 (Why is no real title available?)
- A new method for deriving waiting-time approximations in polling systems with renewal arrivals
- A two-queue polling model with two priority levels in the first queue
- Delay in polling systems with large switch-over times
- Generalized trapezoidal distributions
- Mathematical methods to study the polling systems
- Mean value analysis for polling systems
- On the transition from heavy traffic to heavy tails for the \(M/G/1\) queue: the regularly varying case
- Polling systems and multitype branching processes
- Polling systems in heavy traffic: Higher moments of the delay
- Polling systems in heavy traffic: a Bessel process limit
- Polling systems with periodic server routeing in heavy traffic: distribution of the delay
- Polling systems with periodic server routing in heavy traffic: renewal arrivals
- Polling systems with switch-over times under heavy load: Moments of the delay
- Polling systems with zero switchover times: A heavy-traffic averaging principle
- Probability with Martingales
- Properties of the Gittins index with application to optimal scheduling
- Sojourn times in a processor sharing queue with multiple vacations
- Towards a unifying theory on branching-type polling systems in heavy traffic
Cited in
(8)- scientific article; zbMATH DE number 1783876 (Why is no real title available?)
- Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
- Investigation of the stochastic polling system and its applications to broadband wireless networks
- Average waiting time of a symmetric polling system under Bernoulli scheduling
- Queue lengths and workloads in polling systems
- Polling: past, present, and perspective
- Optimization of polling systems with Bernoulli schedules
- Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations
This page was built for publication: The impact of scheduling policies on the waiting-time distributions in polling systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018945)
