Optimal Buffer Partitioning on a Multiuser Wireless Link

Omur OZEL; Elif UYSAL-BIYIKOGLU; Tolga GIRICI

doi:10.1587/transcom.E94.B.3399

Optimal Buffer Partitioning on a Multiuser Wireless Link

Omur OZEL, Elif UYSAL-BIYIKOGLU, Tolga GIRICI

Full Text Views

0

Share
Cite this

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/m_i 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.

Publication: IEICE TRANSACTIONS on Communications Vol.E94-B No.12 pp.3399-3411

Publication Date: 2011/12/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E94.B.3399

Type of Manuscript: PAPER

Category: Fundamental Theories for Communications

Cite this

Copy

Omur OZEL, Elif UYSAL-BIYIKOGLU, Tolga GIRICI, "Optimal Buffer Partitioning on a Multiuser Wireless Link" in IEICE TRANSACTIONS on Communications, vol. E94-B, no. 12, pp. 3399-3411, December 2011, doi: 10.1587/transcom.E94.B.3399.
Abstract: 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/m_i 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.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.3399/_p

Copy

@ARTICLE{e94-b_12_3399,
author={Omur OZEL, Elif UYSAL-BIYIKOGLU, Tolga GIRICI, },
journal={IEICE TRANSACTIONS on Communications},
title={Optimal Buffer Partitioning on a Multiuser Wireless Link},
year={2011},
volume={E94-B},
number={12},
pages={3399-3411},
abstract={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/m_i 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.},
keywords={},
doi={10.1587/transcom.E94.B.3399},
ISSN={1745-1345},
month={December},}

Copy

TY - JOUR
TI - Optimal Buffer Partitioning on a Multiuser Wireless Link
T2 - IEICE TRANSACTIONS on Communications
SP - 3399
EP - 3411
AU - Omur OZEL
AU - Elif UYSAL-BIYIKOGLU
AU - Tolga GIRICI
PY - 2011
DO - 10.1587/transcom.E94.B.3399
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2011
AB - 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/m_i 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.
ER -