The author investigates the properties of single server queueing systems with customers of different types. The server rotates from one class of customers to another in a prescribed sequence. All customers that have accumulated for each class are served at once. Certain linearity assumptions are made for arrival and service time. The author points out that such appropriately chosen linearizations meet a variety of complex arrival and service processes. Hereof queue-length and waiting-time characteristics are derived.
Recommendations
Cites work
- Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems—Exact Results and Applications
- scientific article; zbMATH DE number 4055548 (Why is no real title available?)
- scientific article; zbMATH DE number 3793182 (Why is no real title available?)
- Queues for a Vehicle-Actuated Traffic Light
- Queuing analysis of polling models
Cited in
(7)- Stability, monotonicity and invariant quantities in general polling systems
- Optimal control of polling models for transportation applications
- Fluid polling systems
- Mathematical methods to study the polling systems
- scientific article; zbMATH DE number 845596 (Why is no real title available?)
- scientific article; zbMATH DE number 863597 (Why is no real title available?)
- Dominance relations in polling systems
This page was built for publication: Some properties of polling systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749055)
