Queue Proportional Scheduling in Gaussian Broadcast Channels
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 1647-1652
- https://doi.org/10.1109/icc.2006.254955
Abstract
Queue Proportional Scheduling (QPS) assigns each user a data rate proportional to the number of packets (or bits) in that user's queue. This paper analyzes stability, delay and fairness properties of QPS in a Gaussian broadcast channel (BC). QPS is shown to achieve throughput optimality, and guarantee fairness as well as different priorities among users in terms of average queuing delay. One well known throughput optimal policy for broadcast channels is Maximum Weight Matching Scheduling (MWMS) that maximizes the inner product of the queue state vector and the achievable rate vector. Simulation results with Poisson packet arrivals and exponentially distributed packet lengths demonstrate that QPS provides a significant decrease in average queuing delay compared to MWMS in a Gaussian BC.Keywords
This publication has 10 references indexed in Scilit:
- Queue proportional scheduling via geometric programming in fading broadcast channelsIEEE Journal on Selected Areas in Communications, 2006
- Rate Scheduling in Multiple Antenna Downlink Wireless SystemsIEEE Transactions on Communications, 2005
- Joint channel-aware and queue-aware data scheduling in multiple shared wireless channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Fundamental performance limits for wireless fading channels - Cross-layer wireless resource allocationIEEE Signal Processing Magazine, 2004
- Power allocation and routing in multibeam satellites with time-varying channelsIEEE/ACM Transactions on Networking, 2003
- Throughput and delay optimal resource allocation in multiaccess fading channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Throughput-optimal scheduling for broadcast channelsPublished by SPIE-Intl Soc Optical Eng ,2001
- Scheduling in multimedia wireless networksPublished by Elsevier ,2001
- Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacitiesIEEE Transactions on Information Theory, 1998
- Dynamic server allocation to parallel queues with randomly varying connectivityIEEE Transactions on Information Theory, 1993