Abstract:
We study the optimal control problem in a queueing network under incomplete data. With dynamic programming, we solve the optimal control problem for the network state and observations. We give a general method that can answer what, where, when, and how to measure in the network when solving dynamic routing problems. We define general notions and methods of the theory of network measurement. We give examples of solving joint optimal control and observation problems for elementary network structures and modern telecommunication systems.
Presented by the member of Editorial Board:A. I. Lyakhov
Fulltext:
PDF file (310 kB)
