Model Analysis of Asymmetric Polling Systems with Limiting Service
-
Graphical Abstract
-
Abstract
A new approximation technique is proposed to asymmetric polling queuing systems with limited service (K=1) in discrete time.The mathematical model is derived from imbedded Markov chain theory and the generating function and the moments about random cyclic time.Accurate estimates of mean packet waiting times are obtained.The simulation results are given.
-
-