.png){kind=icon}
.png){kind=icon}
Return
On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability
.png){kind=icon}
PRE
AI
DOI：10.1109/TNET.2009.2037896.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a large-deviation setting, we are interested in algorithms that maximize the asymptotic decay rate of the queue-overflow probability, as the queue-overflow threshold approaches infinity. We first derive an upper bound on the decay rate of the queue-overflow probability over all scheduling policies. We then focus on a class of scheduling algorithms collectively referred to as the alpha-algorithms. For a given alpha >= 1, the alpha-algorithm picks the user for service at each time that has the largest product of the transmission rate multiplied by the backlog raised to the power alpha. We show that when the overflow metric is appropriately modified, the minimum-cost-to-overflow under the alpha-algorithm can be achieved by a simple linear path, and it can be written as the solution of a vector-optimization problem. Using this structural property, we then show that when alpha approaches infinity, the alpha-algorithms asymptotically achieve the largest decay rate of the queue-overflow probability. Finally, this result enables us to design scheduling algorithms that are both close to optimal in terms of the asymptotic decay rate of the overflow probability and empirically shown to maintain small queue-overflow probabilities over queue-length ranges of practical interest.
Keywords:
Asymptotically optimal algorithms
cellular system
large deviations
queue-overflow probability
wireless scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.6
Papers:
4.4K
Citations:
9.5K
