Some properties of polling systems
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.
single server queueing systems with customers of different types
scientific article; zbMATH DE number 4172122