Analysis of polling systems
Mean value analysis for polling systems
Queueing Systems: Theory and Applications
Iterative approximation of k-limited polling systems
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We consider a new mathematical model that adequately represents the workings of a cyclic polling system in high-speed wireless MESH-networks. The queues are serviced by two processing units (servers) in a cyclic fashion. Part of the queues are available for cyclic polling for both servers; each of the remaining queues is attached to its "own" processing unit in the servicing cycle. To study this system, we have applied the mean value approach and have obtained analytic expressions for average waiting times of claims in the queues and other characteristics. The paper also presents numerical examples.