Traffic aided opportunistic scheduling for wireless networks: algorithms and performance bounds
Computer Networks: The International Journal of Computer and Telecommunications Networking
User-level performance of channel-aware scheduling algorithms in wireless data networks
IEEE/ACM Transactions on Networking (TON)
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
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Flow-level performance and capacity of wireless networks with user mobility
Queueing Systems: Theory and Applications
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
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
File transmission over wireless fast fading downlink
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
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
Scheduling of users with markovian time-varying transmission rates
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
| Hi-index | 0.00 |
We consider service systems where new jobs not only increase the load but also improve the service ability of such a system, cf. opportunistic scheduling gain in wireless systems. We study the optimal trade-off between the SRPT (Shortest Remaining Processing Time) discipline and opportunistic scheduling in the systems characterized by compact and symmetric capacity regions. The objective is to minimize the mean delay in a transient setting where all jobs are available at time 0 and no new jobs arrive thereafter. Our main result gives conditions under which the optimal rate vector does not depend on the sizes of the jobs as long as their order (in size) remains the same. In addition, it shows that in this case the optimal policy applies the SRPT principle serving the shortest job with the highest rate of the optimal rate vector, the second shortest with the second highest rate etc. We also give a recursive algorithm to determine both the optimal rate vector and the minimum mean delay. In some special cases, the rate vector, as well as the minimum mean delay, have even explicit expressions as demonstrated in the paper. For the general case, we derive both an upper bound and a lower bound of the minimum mean delay.