Finite Backlog Effects on Downlink Scheduling
نویسندگان
چکیده
In a multi-user downlink system, the use of channel estimates in the scheduling process can significantly improve the spectral efficiency. Recent work has shown that from a sum rate capacity standpoint, and assuming infinite queue backlogs, the optimal transmission scheme is to select the user with the largest instantaneous channel gain. A more realistic scenario is considered in this work, in which the downlink scheduling problem with finite queue backlogs is analyzed. It is shown that although time division scheduling is optimal for infinite backlogs, this is not the case for finite buffer sizes. In fact, a simple broadcast scheduler is shown to be more power efficient than the maximum rate time division scheduler under such a scenario.
منابع مشابه
Resource allocation under channel uncertainty
Scheduling policies in multi-queue multi-server systems need to allocate servers based on the channel state information and the queue state information. In the downlink, channel state information available to the scheduler may be imperfect due to feedback delay and estimation errors. Motivated by this, we consider the downlink scheduling problem of allocating servers to multi-queue multi-server...
متن کاملRobust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation (New Simulation Figures)
This paper considers the downlink traffic from a base station to two different clients. When assuming infinite backlog, it is known that inter-session network coding (INC) can significantly increase the throughput. However, the corresponding scheduling solution (when assuming dynamic arrivals instead and requiring bounded delay) is still nascent. For the 2-flow downlink scenario, we propose the...
متن کاملRobust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation
This paper considers the downlink traffic from a base station to two different clients. When assuming infinite backlog, it is known that inter-session network coding (INC) can significantly increase the throughput of each flow. However, the corresponding scheduling solution (when assuming dynamic arrivals instead and requiring bounded delay) is still nascent. For the 2-flow downlink scenario, w...
متن کاملEnergy-Efficient Downlink Resource Scheduling for LTE-A Networks with Carrier Aggregation
To tackle the dilemma of supporting broadband, high-speed wireless access or well utilizing narrow, non-contiguous spectral resource, Long Term Evolution-Advanced (LTE-A) employs carrier aggregation. It combines different component carriers to send data to users in high rates. Many LTE-A downlink resource scheduling methods seek to assign component carriers or resource blocks to improve through...
متن کاملStructural Properties of LDP for Queue-Length Based Wireless Scheduling Algorithms
In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Assuming that a samplepath large-deviation principle holds for the backlog process, we first study structural properties of the minimum-cost-pathto-overflow for a class of scheduling algorithms collectively referred to as the “α-algorithms.” For ...
متن کامل