Bounding the blocking probabilities in multirate CDMA networks supporting elastic services
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We consider an interference-limited code division multiple access (CDMA) network, in which some of the service classes are explicit rate controlled. Such rate-controlled service classes include adaptive ones whose holding time does not depend on the sending rate, while the holding time of elastic services becomes longer when their sending rate is slowed down. We develop a Markov model that allows us to study the impact of employing service differentiation (prioritization) during admission control and rate control on the classwise blocking probabilities and throughputs. The admission control takes into account the interference from adjacent cells as a log-normally distributed random variable and employs service class and state-dependent (soft) blocking in addition to hard blocking. The state-dependent rate control algorithm takes into account the minimum and maximum requested rates of admitted sessions in a fairness policy-dependent manner. Our conclusion is that work conserving bandwidth sharing policies may have a major impact on the moments of the time spent in the system by elastic services, but only a minor one on the classwise blocking probabilities. When the admission control algorithm takes into account the neighbour cell caused interference, the blocking probability of all classes increases somewhat, but the throughput of the accepted sessions increases. Blocking prioritization in the soft blocking model affects the classwise total blocking probabilities but has little impact on the throughput of adaptive and elastic traffic. Copyright © 2006 John Wiley & Sons, Ltd.