Elements of information theory
Elements of information theory
Power allocation and routing in multibeam satellites with time-varying channels
IEEE/ACM Transactions on Networking (TON)
Throughput maximization under rate requirements for the OFDMA downlink channel with limited feedback
EURASIP Journal on Wireless Communications and Networking - Multicarrier Systems
Markov Chains and Stochastic Stability
Markov Chains and Stochastic Stability
Computationally efficient bandwidth allocation and power control for OFDMA
IEEE Transactions on Wireless Communications
Multiuser OFDM with adaptive subcarrier, bit, and power allocation
IEEE Journal on Selected Areas in Communications
A fundamental characterization of stability in broadcast queueing systems
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
IEEE Transactions on Wireless Communications
Scheduling for improving system capacity in multiservice 3GPP LTE
Journal of Electrical and Computer Engineering - Special issue on LTE/LTE-advanced cellular communication networks
A Simple Superposition Coding Scheme for Optimizing Resource Allocation in Downlink OFDMA Systems
Wireless Personal Communications: An International Journal
| Hi-index | 0.01 |
While multiuser scheduling strategies have been intensively studied in the context of OFDMA downlink recently, the resulting throughput and delay performance affecting strongly end-to-end performance of wireless communication systems can still be evaluated by simulations only. In this paper we approach this problem and consider bounds for delay and queue backlog for a large class of scheduling policies. Adopting a general state space Markov chain model the concept of policy-specific throughput regions is introduced. Then, under the regime of the policy, a recursive formula for calculating all polynomial moments of the queue backlog is derived. Moreover, it is shown that even exponential decay of the tail distribution can be obtained under proper circumstances. Based on these results, upper bounds on the buffer overflow probability are derived giving insights for practical buffer dimensioning problems in UMTS LTE systems.