Stochastic primal-dual scheduling subject to rate constraints

In this paper we derive a stochastic primal-dual (SPD) algorithm for downlink/uplink scheduling of multiple connections with rate requirements, where each connection transmits using adaptive modulation and coding over a wireless fading channel. Based on quantized channel state information at the transmitters, we derive the information-theoretic optimal downlink and uplink resource allocation/scheduling strategies. When the fading statistics are not known a priori, we develop an SPD algorithm which can dynamically adapt the scheduling policy online. We established analytically and confirm by simulations that with affordable complexity, this SPD algorithm asymptotically converges to the optimal scheduling strategies from any initial value.