Effective Resource Allocation in a Queue: How Much Control Is Necessary?
In this paper, the authors consider a single-server queue with Poisson inputs and two distinct service rates. The service rate employed at any given instant is decided by a resource allocation policy, based on the queue occupancy. They deal with the question of how often control information needs to be sent to the rate scheduler so as to stay below a certain probability of congestion. They first consider some simple Markovian service rate allocation policies and derive the corresponding control rate vs. congestion probability tradeoffs in closed form.