Utility maximization for arbitrary traffic in communication networks

MaxWeight-based throughput-optimal link scheduling schemes have been shown to attain the maximum utility in communication networks for any feasible input traffic. However, for input traffic outside the capacity region, they fail to achieve the maximum utility. Although a joint solution with admission controller has been recently developed to address the problem, it requires additional structural complexity with non-intuitive state variables, which further complicates the already complex MaxWeight-based schemes. In this paper, we take more direct control of the arrivals, and develop a new joint solution with simpler admission controller and less structural complexity. Our scheme provably achieves the maximum utility, and empirically outperforms the previous solution in terms of delay.