The Complexity of Optimal Queuing Network Control
Mathematics of Operations Research
Scheduling for Minimum Total Loss Using Service Time Distributions
Journal of the ACM (JACM)
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)
Characterization and computation of restless bandit marginal productivity indices
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
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
Asymptotically fair transmission scheduling over fading channels
IEEE Transactions on Wireless Communications
Convergence of proportional-fair sharing algorithms under general conditions
IEEE Transactions on Wireless Communications
Instability of the proportional fair scheduling algorithm for HDR
IEEE Transactions on Wireless Communications
Dynamic server allocation to parallel queues with randomly varying connectivity
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
On the optimal trade-off between SRPT and opportunistic scheduling
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
On the optimal trade-off between SRPT and opportunistic scheduling
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Stability with file arrivals and departures in multichannel cellular wireless networks
Queueing Systems: Theory and Applications
Stability and asymptotic optimality of opportunistic schedulers in wireless systems
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Optimal size-based opportunistic scheduler for wireless systems
Queueing Systems: Theory and Applications
Opportunistic schedulers for optimal scheduling of flows in wireless systems with ARQ feedback
Proceedings of the 24th International Teletraffic Congress
Stability of flow-level scheduling with Markovian time-varying channels
Performance Evaluation
Scheduling of users with markovian time-varying transmission rates
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Scheduling in a random environment: stability and asymptotic optimality
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We introduce a comprehensive modeling framework for the problem of scheduling a finite number of finite-length jobs where the available service rate is time-varying. The main motivation comes from wireless data networks where the service rate of each user varies randomly due to fading. We employ recent advances on the restless bandit problem that allow us to obtain an opportunistic scheduling rule for the system without arrivals. When the objective is to minimize the mean number of users in the system or to minimize the mean waiting time, we obtain a priority-based policy which we call the ''Potential Improvement'' (PI) rule, since the priority index equals the ratio between the current available service rate and the expected potential improvement of the service rate. We also show that for certain objective functions, the index rule takes the form of known opportunistic scheduling rules like ''Relatively Best'' (RB) or ''Proportionally Best'' (PB). Thus our model provides a formal justification for the deployment of opportunistic scheduling rules in order to improve the flow-level performance in the presence of time-varying capacities. We further analyze the performance of the PI rule in the presence of randomly arriving users. When the service rates are constant, PI is equivalent to the c@m-rule, which is known to be optimal with any distribution of arrivals. Using a recent characterization for the stability region of flow-level scheduling rules under random arrivals, we show that PI achieves the maximum stability region. We perform numerical experiments in a wide range of scenarios and compare the performance of PI with other popular disciplines like RB, PB, Score-Based (SB) and the c@m-rule. Our results show that RB, PB, SB or the c@m-rule might outperform the others depending on the scenario, but regardless of this, the performance of PI is always superior or equivalent to the best of these opportunistic rules.