Fair scheduling in wireless packet networks
IEEE/ACM Transactions on Networking (TON)
Optimal Transmission Policies for Noisy Channels
Operations Research
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS
Probability in the Engineering and Informational Sciences
Probability in the Engineering and Informational Sciences
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data
Journal of the ACM (JACM)
Instability of the proportional fair scheduling algorithm for HDR
IEEE Transactions on Wireless Communications
Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Optimal scheduling in high-speed downlink packet access networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Optimal scheduling in multi-server queues with random connectivity and retransmissions
Computer Communications
| Hi-index | 0.00 |
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of emerging 3G/4G wireless systems. We introduce the class of Most Balancing (MB) policies and provide their mathematical characterization. We prove that MB policies are optimal among all work conserving policies; we define optimality as minimization, in stochastic ordering sense, of a range of cost functions of the queue lengths, including the process of total number of packets in the system. We use dynamic coupling arguments for our proof. We also introduce the Least Connected Server First/Longest Connected Queue (LCSF/LCQ) policy as an approximate implementation of MB policies. We conduct a simulation study to compare the performance of several work conserving policies to that of the optimal one. In the simulations we relax some of the mathematical assumptions we required for the analytical proofs. The simulation results show that: (a) in all cases, MB policies outperform the other policies, (b) randomized policies perform fairly close to the optimal one, and, (c) the performance advantage of the optimal policy over the other work conserving policies increases as the channel connectivity decreases.