Control and observation for dynamical queueing networks. I

Authors:
Yu. V. Solodyannikov
Affiliations:
SJC "Samara-Dialog", Samara, Russia
Venue:
Automation and Remote Control
Year:
2014

Citing 3
Cited 0

Stochastic dynamic programming and the control of queueing systems

Stochastic dynamic programming and the control of queueing systems
Using methods of stochastic control to prevent overloads in data transmission networks

Automation and Remote Control
Methods to design optimal control of Markov process with finite state set in the presence of constraints

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.