User-level performance of channel-aware scheduling algorithms in wireless data networks
IEEE/ACM Transactions on Networking (TON)
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data
Journal of the ACM (JACM)
High speed downlink packet access (HSDPA): enhanced data rates for UMTS evolution
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the European wireless 2004 conference
Scheduling over nonstationary wireless channels with finite rate sets
IEEE/ACM Transactions on Networking (TON)
Scheduling algorithms for multi-carrier wireless data systems
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
High Speed Downlink Packet Access (HSDPA)-Enhanced Data Rates for UMTS Evolution
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the European wireless 2004 conference
Performance analysis of wireless opportunistic schedulers using stochastic Petri nets
IEEE Transactions on Wireless Communications
Flow-level performance and capacity of wireless networks with user mobility
Queueing Systems: Theory and Applications
Proportional fairness packet scheduling with transmit beamforming for multi-user MIMO systems
RWS'09 Proceedings of the 4th international conference on Radio and wireless symposium
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Downlink scheduling for multiclass traffic in LTE
EURASIP Journal on Wireless Communications and Networking - 3GPP LTE and LTE Advanced
Throughput optimality of delay-driven maxweight scheduler for a wireless system with flow dynamics
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Optimal resource scheduling in wireless multiservice systems with random channel connectivity
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Packet level scheduling schemes for multi-user MIMO systems with beamforming
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Frequency-domain packet scheduling for 3GPP LTE uplink
INFOCOM'10 Proceedings of the 29th conference on Information communications
A modeling framework for optimizing the flow-level scheduling with time-varying channels
Performance Evaluation
Optimal scheduling in high-speed downlink packet access networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Delay-optimal opportunistic scheduling and approximations: the log rule
IEEE/ACM Transactions on Networking (TON)
Scheduling algorithms for multicarrier wireless data systems
IEEE/ACM Transactions on Networking (TON)
Inter-sector interference mitigation method in triple-sectored OFDMA systems
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Power control for soft fractional frequency reuse in OFDMA system
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
Stability and asymptotic optimality of opportunistic schedulers in wireless systems
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Optimal scheduling in multi-server queues with random connectivity and retransmissions
Computer Communications
Scheduling in a random environment: stability and asymptotic optimality
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
In this letter, we study the Proportional Fair scheduler that has been proposed for scheduling in the high data rate (HDR) wireless data system. We consider a single basestation transmitting to a set of mobile users. In each time slot, the scheduler has to decide on a mobile to which it will transmit data. The decision is based on information that the basestation receives about the time-varying channels between itself and the mobiles. We focus on deciding whether or not Proportional Fair is stable in a situation with finite queues and a data arrival process. That is, we wish to decide if Proportional Fair keeps all queues bounded whenever this is feasible. There are, in fact, multiple versions of Proportional Fair, depending on how it treats small queues. In this letter, we consider six different versions and show that all are unstable for one simple example.