Dynamic fair scheduling with QoS constraints in multimedia wideband CDMA cellular networks

  • Authors:
  • Liang Xu;Xuemin Shen;J. W. Mark

  • Affiliations:
  • Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Ont., Canada;-;-

  • Venue:
  • IEEE Transactions on Wireless Communications
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

A class of dynamic fair scheduling schemes based on the generalized processor sharing (GPS) fair service discipline, under the generic name code-division GPS (CDGPS), is proposed for a wideband direct-sequence code-division multiple-access (CDMA) cellular network to support multimedia traffic. The CDGPS scheduler makes use of both the traffic characteristics in the link layer and the adaptivity of the wideband CDMA physical layer to perform fair scheduling on a time-slot by time-slot basis, by using a dynamic rate-scheduling approach rather than the conventional time-scheduling approach. Soft uplink capacity is characterized for designing an efficient CDGPS resource allocation procedure. A credit-based CDGPS (C-CDGPS) scheme is proposed to further improve the utilization of the soft capacity by trading off the short-term fairness. Theoretical analysis shows that, with the C-CDGPS scheme, tight delay bounds can be provided to delay-sensitive traffic, and short-term unfairness can be bounded so that long-term weighted fairness for all users can still be satisfied. Simulation results show that bounded delays, increased throughput, and long-term fairness can be achieved for both homogeneous and heterogeneous traffic.