Optimal Buffer Partitioning on a Multiuser Wireless Link

Omur OZEL
Elif UYSAL-BIYIKOGLU
Tolga GIRICI

Publication
IEICE TRANSACTIONS on Communications   Vol.E94-B    No.12    pp.3399-3411
Publication Date: 2011/12/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E94.B.3399
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Fundamental Theories for Communications
Keyword: 
buffer partitioning,  multiuser wireless communication,  throughput optimal,  finite buffer,  complete sharing,  complete partitioning,  greedy allocation,  scheduling,  MaxWeight,  

Full Text: PDF(1.1MB)>>
Buy this Article



Summary: 
A finite buffer shared by multiple packet queues is considered. Partitioning the buffer to maximize total throughput is formulated as a resource allocation problem, the solution is shown to be achieved by a greedy incremental algorithm in polynomial time. The optimal buffer allocation strategy is applied to different models for a wireless downlink. First, a set of parallel M/M/1/mi queues, corresponding to a downlink with orthogonal channels is considered. It is verified that at high load, optimal buffer partitioning can boost the throughput significantly with respect to complete sharing of the buffer. Next, the problem of optimal combined buffer allocation and channel assignment problems are shown to be separable in an outage scenario. Motivated by this observation, buffer allocation is considered in a system where users need to be multiplexed and scheduled based on channel state. It is observed that under finite buffers in the high load regime, scheduling simply with respect to channel state with a simply partitioned buffer achieves comparable throughput to combined channel and queue-aware scheduling.