Trading Rate for Balanced Queue Lengths for Network Delay Minimization

摘要: We consider a communication channel with two transmitters and one receiver, an underlying rate region which is approximated as general pentagon. Different from the Gaussian multiple access (MAC) capacity region, sum-rate on dominant face of this pentagon not constant. allocate rates to users according their current queue lengths in order minimize average delay system. formulate problem Markov decision (MDP), derive structural properties corresponding discounted-cost MDP. show that delay-optimal policy has switch curve structure. For problem, we prove limit along dimensions. The divides entire state space into via curve. If side curve, system operates at corner points favors maximum sum-rate. When switches other point balancing lengths. As result, does always operate maximizing pair, but trades for balanced goal minimizing overall delay. existence dimensions implies that, once beyond limit, points, implying queues can be operated partially distributedly.