By Topic

Queueing analysis for the OFDMA downlink: Throughput regions, delay and exponential backlog bounds

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gerhard Wunder ; Fraunhofer German-Sino Lab for Mobile Communications, Heinrich-Hertz-Institut, Einstein-Ufer 37, D-10587 Berlin, Germany ; Chan Zhou

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.

Published in:

IEEE Transactions on Wireless Communications  (Volume:8 ,  Issue: 2 )