By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Stamoulis, A. ; AT&T Labs-Res., Florham Park, NJ, USA ; Sidiropoulos, N. ; Giannakis, G.B.

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

Published in:

Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE  (Volume:6 )

Date of Conference:

2001