The impact of bursty data on hybrid delay/blocking wireless systems with QoS

This paper presents an analysis of hybrid delay/blocking systems with data quality of service (QoS) subject to bursty elastic data traffic, and with wide application to wireless access networks. A key result is that the performance of low priority background traffic for both data resource allocation schemes studied (FRA and RREFS) is largely independent of the burstiness of the traffic. Indeed, the performance of both schemes with only a single data class is largely independent of the traffic characteristics. As in [6], we show significant best effort traffic volumes can be carried while still achieving reasonable performance across all priority classes, for both FRA and RREFS. Finally, we propose and validate a simple ldquoequivalent-capacity Processor Sharing (PS) modelrdquo, to approximate the call-average throughput of FRA traffic, even though the underlying system is strictly not a PS queue.