Data networks
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES
Probability in the Engineering and Informational Sciences
Probability in the Engineering and Informational Sciences
Probability in the Engineering and Informational Sciences
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity (Lecture Notes in Mathematics)
Monotonicity in Markov Reward and Decision Chains: Theory and Applications
Foundations and Trends® in Stochastic Systems
Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity
IEEE Transactions on Information Theory
Delay Optimal Transmission Policy in a Wireless Multiaccess Channel
IEEE Transactions on Information Theory
Multiuser OFDM with adaptive subcarrier, bit, and power allocation
IEEE Journal on Selected Areas in Communications
Optimal bandwidth allocation in a delay channel
IEEE Journal on Selected Areas in Communications
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Queue-aware resource allocation for downlink OFDMA cognitive radio networks
IEEE Transactions on Wireless Communications
Low-complexity scheduling algorithms for multichannel downlink wireless networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 754.84 |
This paper considers the problem of optimal server allocation in a time-slotted system with N statistically symmetric queues and K servers when the arrivals and channels are stochastic and time-varying. In this setting, we identify two classes of "desirable" policies with potentially competing goals of maximizing instantaneous throughput versus balancing the load. Via an example, we show that these goals, in general, can be incompatible, implying an empty intersection between the two classes of polices. On the other hand, we establish the existence of a policy achieving both goals when the connectivities between each queue and each server are random and either "ON" or "OFF." We use dynamic programming (DP) and properties of the value function to establish the delay optimality of a policy, which at each time-slot, simultaneously maximizes the instantaneous throughput and balances the queues.