Abstract
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.
Original language | English (US) |
---|---|
Pages | 3504-3508 |
Number of pages | 5 |
State | Published - 2001 |
Externally published | Yes |
Event | IEEE Global Telecommunications Conference GLOBECOM'01 - San Antonio, TX, United States Duration: Nov 25 2001 → Nov 29 2001 |
Other
Other | IEEE Global Telecommunications Conference GLOBECOM'01 |
---|---|
Country/Territory | United States |
City | San Antonio, TX |
Period | 11/25/01 → 11/29/01 |