The power-series algorithm for M/M/1-type polling system with impatient customers

We investigate a polling model for a radio-cell of the broadband wireless IEEE 802.11 DCF network. Polling system consists of N M/M/1-type queues with impatient customers. The switchover times are assumed to be non-zero. A customer has limited random waiting time and after the time expires the customer leaves the system unless its service has not been started. The computation scheme of the power-series algorithm for the evaluation of the joint queue length distributions for the model under consideration is presented. Having the joint queue length distributions calculated, we obtain the performance characteristics.