Investigation of the stochastic polling system and its applications in broadband wireless networks

A polling system with adaptive dynamic polling order for modeling a broadband wireless network with a centralized control mechanism is considered. A new algorithm for calculating the stationary state probability distribution of the number of packets in subscriber stations has been developed, which makes it possible to calculate the average waiting time and other characteristics of the network performance. A queuing system with several queues is investigated, in which the server serves queues in a dynamic polling order. This order of queuing involves skipping queues that were empty in the previous polling cycle. The queues that were skipped in this cycle the server can poll only in the next cycle. The specified queue servicing algorithm allows to reduce the duration of the queue polling time and thus increase the system performance. A comparative numerical analysis of various options for constructing and evaluating the performance characteristics of broadband wireless IEEE 802.11 networks with a centralized control mechanism is presented. Numerical studies were carried out using a software package for evaluating the stochastic polling systems.