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

Atilla Eryilmaz, R. Srikant

Research output: Contribution to journalArticle

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 queue-length 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)
Pages (from-to)1333-1344
Number of pages12
JournalIEEE/ACM Transactions on Networking
Volume15
Issue number6
DOIs
StatePublished - Dec 1 2007

Keywords

  • Congestion control
  • Proportional fairness
  • Resource management
  • Telecommunication congestion control
  • Throughput-optimal scheduling
  • Wireless communication
  • Wireless networks
  • m-weighted fairness

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • 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