Time-varying fair queuing scheduling for multicode CDMA based on dynamic programming

Fair queuing (FQ) algorithms, which have been proposed for QoS wireline-wireless networking, rely on the fundamental idea that the service rate allocated to user m is proportional to a positive weight φ_m. Targeting wireless data networks with a multicode CDMA-based physical layer, we develop FQ with time-varying weight assignments in order to minimize the queuing delays of mobile users. Applying dynamic programming, we design a computationally efficient algorithm which produces the optimal service rates while obeying (i) constraints imposed by the underlying physical layer, and (ii) QoS requirements. Simulations illustrate the merits of our designs