On the Role of Queue Length Information in Network Control
In this paper, the authors study the role played by queue length information in the operation of flow control and server allocation policies. They first consider a simple model of a single server queue with congestion-based flow control. The input rate at any instant is decided by a flow control policy, based on the queue occupancy. The authors identify a simple 'Two threshold' control policy, which achieves the best possible exponential scaling for the queue congestion probability, for any rate of control. The authors show that when the control channel is reliable, the control rate needed to ensure the optimal decay exponent for the congestion probability can be made arbitrarily small.