SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Traffic aided opportunistic scheduling for wireless networks: algorithms and performance bounds
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
User-level performance of channel-aware scheduling algorithms in wireless data networks
IEEE/ACM Transactions on Networking (TON)
Stability of Parallel Queueing Systems with Coupled Service Rates
Discrete Event Dynamic Systems
Combining opportunistic and size-based scheduling in wireless systems
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks
IEEE/ACM Transactions on Networking (TON)
Flow-level performance and capacity of wireless networks with user mobility
Queueing Systems: Theory and Applications
Downlink scheduling for multiclass traffic in LTE
EURASIP Journal on Wireless Communications and Networking - 3GPP LTE and LTE Advanced
Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics
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
Asymptotically fair transmission scheduling over fading channels
IEEE Transactions on Wireless Communications
Instability of the proportional fair scheduling algorithm for HDR
IEEE Transactions on Wireless Communications
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
| Hi-index | 0.00 |
We investigate the scheduling of a common resource between several concurrent users when the feasible transmission rate of each user varies randomly over time. Time is slotted and users arrive and depart upon service completion. This may model for example the flow-level behavior of end-users in a narrowband HDR wireless channel (CDMA 1xEV-DO). As performance criteria we consider the stability of the system and the mean delay experienced by the users. Given the complexity of the problem we investigate the fluid-scaled system, which allows to obtain important results and insights for the original system: (1) We characterize for a large class of scheduling policies the stability conditions and identify a set of maximum stable policies, giving in each time slot preference to users being in their best possible channel condition. We find in particular that many opportunistic scheduling policies like Score-Based [9], Proportionally Best [1] or Potential Improvement [4] are stable under the maximum stability conditions, whereas Relative-Best [10] or the cμ-rule are not. (2) We show that choosing the right tie-breaking rule is crucial for the performance (e.g. average delay) as perceived by a user. We prove that a policy is asymptotically optimal if it is maximum stable and the tie-breaking rule gives priority to the user with the highest departure probability. In particular, we show that simple priority-index policies with a myopic tie-breaking rule, are stable and asymptotically optimal. All our findings are validated with extensive numerical experiments.