An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Scheduling real-time traffic with deadlines over a wireless channel
WOWMOM '99 Proceedings of the 2nd ACM international workshop on Wireless mobile multimedia
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
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
Providing quality of service over a shared wireless link
IEEE Communications Magazine
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
IEEE Journal on Selected Areas in Communications
Scheduling algorithms for multi-carrier wireless data systems
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Scheduling algorithms for multicarrier wireless data systems
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We consider a wireless basestation transmitting high-speed data to multiple mobile users in a cell. The channel conditions between the basestation and the users are time-varying and user-dependent. Our objective is to design a scheduler that determines which user to schedule at each time step. Previous work on this problem has typically assumed that the channel conditions are governed by a stationary stochastic process. In this setting, a popular algorithm known as Max-Weight has been shown to have good performance.However, the stationarity assumption is not always reasonable. In this paper, we study a more general worst-case model in which the channel conditions are governed by an adversary and are not necessarily stationary. In this model, we show that the nonstationarities can cause Max-Weight to have extremely poor performance. In particular, even if the set of possible transmission rates is finite, as in the CDMA 1xEV-DO system, Max-Weight can produce queue sizes that are exponential in the number of users. On the positive side, we describe a set of tracking algorithms that aim to track the performance of a schedule maintained by the adversary. For one of these tracking algorithms, the queue sizes are only quadratic.We discuss a number of practical issues associated with the tracking algorithms. We also illustrate the performance of Max-Weight and the tracking algorithms using simulation.