Low Complexity Fair Scheduling in LTE Uplink Involving Different Traffic Classes
share
Long term evolution (LTE) has already been accepted as the de-facto 4G wireless technology. However, the bulk of the research on LTE packet scheduling is concentrated in the downlink and the uplink is comparatively less explored. In uplink, mostly channel aware scheduling with throughput maximization has been studied. Further, channel aware scheduling requires an infinitely backlogged buffer model. This makes the investigations unrealistic. Therefore, in this work, we propose an LTE uplink packet scheduling procedure with a realistic traffic source. Firstly, we advocate a joint channel and buffer aware algorithm, which seeks to maximize the actual number of bits transmitted once a user is scheduled. Thereafter, we modify our algorithm to support traffic types with delay constraints. Next, we enhance our algorithm to support multiple classes of traffic. Finally, we have introduced priority flipping to minimize bandwidth starvation of lower priority traffics in presence of higher percentage of high priority traffic. In all the proposals, we have replaced the delay constraint by minimizing the packet drop due to delay violation. This further helps in reducing the problems to a well-known assignment problem.
READ FULL TEXT