Dynamic programming tools for control of telecommunication systems

We study monotonicity results for optimal policies of various queueing and resource sharing models. The standard approach is to prove, for each specific model, certain properties of the dynamic programming value function. By concentrating on the events instead of the entire value function we come to a unified treatment of monotonicity results for symmetric two-dimensional models. Several models from the queueing and telecommunications literature fall into this framework. This allows us to generalize these results in various directions, and to put them into a broader perspective