Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control

Atilla Eryilmaz, R. Srikant

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different receiver. The channel conditions may be time-varying and different for different receivers. It is well-known that appropriately chosen queuelength based policies are throughput-optimal while other policies based on the estimation of channel statistics can be used to allocate resources fairly (such as proportional fairness) among competing users. In this paper, we show that a combination of queue-length-based scheduling at the base station and congestion control implemented either at the base station or at the end users can lead to fair resource allocation and queue-length stability.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
EditorsK. Makki, E. Knightly
Pages1794-1803
Number of pages10
DOIs
StatePublished - 2005
EventIEEE INFOCOM 2005 - Miami, FL, United States
Duration: Mar 13 2005Mar 17 2005

Publication series

NameProceedings - IEEE INFOCOM
Volume3
ISSN (Print)0743-166X

Other

OtherIEEE INFOCOM 2005
Country/TerritoryUnited States
CityMiami, FL
Period3/13/053/17/05

Keywords

  • Congestion control
  • Proportional fairness
  • Throughput-optimal scheduling
  • Wireless networks

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control'. Together they form a unique fingerprint.

Cite this