Control and observation for dynamical queueing networks. I

For the optimal control problem for a queueing network state, we write the Bellman equation and give examples of its analytic and numerical solutions. In the first part, we give examples of solving optimal control problems for elementary network structures. In the second part, we give a solution of the optimal control problem for the network state and observations that gives an answer to the question of what, when, where, and how to measure in the network while solving dynamic routing problems. We give examples of solving synthesis problems for optimal controls and optimal network informational structures for modern telecommunicational systems.