Approximating queue size and waiting time distributions in general polling systems

DOI10.1007/BF01158768zbMath0938.68544OpenAlexW2077990496MaRDI QIDQ1342960

Ziv Katalan, Awi Federgruen

Publication date: 21 June 2000

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01158768

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Polling: past, present, and perspective ⋮ Iterative approximation of \(k\)-limited polling systems ⋮ Mathematical methods to study the polling systems ⋮ Approximations for the waiting time distribution in polling models with and without state-dependent setups ⋮ Polling systems with periodic server routeing in heavy traffic: distribution of the delay ⋮ Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times

Cites Work

• A numerical approach to cyclic-service queueing models
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Efficient visit frequencies for polling tables: Minimization of waiting cost
• Workloads and waiting times in single-server systems with multiple customer classes
• Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
• Sample-path derivations of the excess, age, and spread distributions
• Dynamic priority rules for cyclic-type queues
• Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems—Exact Results and Applications
• Queues with Periodic Service and Changeover Time
• The individual station technique for the analysis of cyclic polling systems
• Unnamed Item
• Unnamed Item