Abstract
The downlink rate scheduling problem is considered for CDMA networks with multiple users carrying packets of heterogeneous traffic (voice/audio only, bursty data only or mixed traffic), with each type having its own distinct quality of service requirements. Several rate scheduling algorithms are developed, the common factor of which is that part of the decision on which users to serve is based on a function of the deadline of their head-of-line packets. An approach of Andrews et al., in which the basic Earliest-Deadline-First algorithm is studied for similar systems, is extended to result in better performance by considering a more efficient power usage and by allowing service of more than one user per timeslot if the power resources permit it. Finally, the performance of the proposed schemes is compared through simulations.
Original language | English (US) |
---|---|
Pages (from-to) | 199-207 |
Number of pages | 9 |
Journal | Journal of Communications and Networks |
Volume | 4 |
Issue number | 3 |
DOIs | |
State | Published - Sep 2002 |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Networks and Communications
Keywords
- CDMA networks
- Deadline
- Heterogeneous traffic
- Quality-of-service requirements
- Rate allocation