Information Theory vs. Queueing Theory for Resource Allocation in Multiple Access Channels

Simple item page
dc.creatorParandehGheibi, Ali
dc.creatorMedard, Muriel
dc.creatorOzdaglar, Asuman
dc.creatorEryilmaz, Atilla
dc.date2008-10-07
dc.date.accessioned2026-07-07T10:08:11Z
dc.date.available2026-07-07T10:08:11Z
dc.descriptionWe consider the problem of rate allocation in a fading Gaussian multiple-access channel with fixed transmission powers. The goal is to maximize a general concave utility function of the expected achieved rates of the users. There are different approaches to this problem in the literature. From an information theoretic point of view, rates are allocated only by using the channel state information. The queueing theory approach utilizes the global queue-length information for rate allocation to guarantee throughput optimality as well as maximizing a utility function of the rates. In this work, we make a connection between these two approaches by showing that the information theoretic capacity region of a multiple-access channel and its stability region are equivalent. Moreover, our numerical results show that a simple greedy policy which does not use the queue-length information can outperform queue-length based policies in terms of convergence rate and fairness.
dc.description5 pages. In proc. of PIMRC 2008
dc.identifierhttps://arxiv.org/abs/0810.1267
dc.identifierhttp://arxiv.org/abs/0810.1267
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/170908
dc.subjectInformation Theory
dc.subjectNetworking and Internet Architecture
dc.subjectOptimization and Control
dc.titleInformation Theory vs. Queueing Theory for Resource Allocation in Multiple Access Channels
dc.typetext

Files

Collections

arXiv