A Probabilistic Threshold-Based Bandwidth Sharing Policy for Wireless Multirate Loss Networks

We propose a probabilistic bandwidth sharing policy, based on the threshold (TH) policy, for a single cell of fixed capacity in a homogeneous wireless cellular network. The cell accommodates random input-traffic originated from K service-classes. We distinguish call requests to new and handover, and therefore, the cell supports 2K types of arrivals. If the number of in-service calls (new or handover) of a service-class exceeds a threshold (different for new and handover calls of a service-class), a new or handover arriving call of the same service-class is not always blocked, as it happens in the TH policy, but it is accepted in the system with a predefined state-dependent probability. The cell is analyzed as a multirate loss system, via a reversible continuous-time Markov chain, which leads to a product form solution (PFS) for the steady state distribution. Thanks to the PFS, the calculation of performance measures is accurate, but complex. To reduce the computational complexity, we determine performance measures via a convolution algorithm.