Critically loaded k-limited polling systems
We consider a two-queue polling model with switch-over times and k-limited service (serve at most ki customers during one visit period to queue i) in each queue. The major benefit of the k-limited service discipline is that it - besides bounding the cycle time - effectuates prioritization by assigni...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
European Alliance for Innovation (EAI)
2016-12-01
|
| Series: | EAI Endorsed Transactions on Collaborative Computing |
| Subjects: | |
| Online Access: | http://eudl.eu/doi/10.4108/eai.14-12-2015.2262578 |