Cyclic Bernoulli polling
From MaRDI portal
Recommendations
Cites work
- Dynamic priority rules for cyclic-type queues
- scientific article; zbMATH DE number 4055548 (Why is no real title available?)
- scientific article; zbMATH DE number 19790 (Why is no real title available?)
- scientific article; zbMATH DE number 19794 (Why is no real title available?)
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- Polling systems with synchronization constraints
- Pseudo-conservation laws in cyclic-service systems
- Stability, monotonicity and invariant quantities in general polling systems
- The Analysis of Random Polling Systems
- Workloads and waiting times in single-server systems with multiple customer classes
Cited in
(7)- Single-server queues with spatially distributed arrivals
- Gated polling with stationary ergodic walking times, Markovian routing and random feedback
- Mathematical methods to study the polling systems
- POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS
- BMAP/G/1 cyclic polling model with binomial disciplines
- BMAP/G/1 Cyclic Polling Model with Binomial Disciplines
- A duplex cyclic polling system for mixed queues
This page was built for publication: Cyclic Bernoulli polling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3135912)