Cyclic Bernoulli polling

DOI10.1007/BF01416007zbMath0778.60066OpenAlexW2009541756MaRDI QIDQ3135912

Uri Yechiali, Eitan Altman

Publication date: 21 September 1993

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

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

zbMATH Keywords

generating functionsoptimisation problemsexpected waiting timesrandom cyclic polling

Mathematics Subject Classification ID

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

Related Items (4)

Single-server queues with spatially distributed arrivals ⋮ Mathematical methods to study the polling systems ⋮ POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS ⋮ Gated polling with stationary ergodic walking times, Markovian routing and random feedback

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability, monotonicity and invariant quantities in general polling systems
• Polling systems with synchronization constraints
• Workloads and waiting times in single-server systems with multiple customer classes
• Pseudo-conservation laws in cyclic-service systems
• The Analysis of Random Polling Systems
• Dynamic priority rules for cyclic-type queues

This page was built for publication: Cyclic Bernoulli polling