Control and observation for dynamical queueing networks. II.

被引：0

作者：

Yu. V. Solodyannikov

机构：

[1] SJC “Samara-Dialog,

[2] ”,undefined

来源：

Automation and Remote Control | 2014年 / 75卷

关键词：

Time Slot; Remote Control; Optimal Control Problem; Queue Length; Bellman Equation;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用

页码：880 / 899

页数：19

共 12 条

[1]

Solodyannikov YuV(2014)Control and Observation for Dynamical Queueing Networks. I Autom. Remote Control 75 422-446

[2]

Joshikawa T(1978)Separation of Estimation and Control for Decentralized Stochastic Control Systems Automatica COM-25 95-104

[3]

Kobajashi H(2005)Computing VVH in Cellular Communication Networks while Accounting for the Users’ Mobility Vestn. Ross. Univ. Druzhby Narodov, Ser. Prikl. Komp. Mat. 4 11-18

[4]

Basharin GP(1977)Optimal Control of Jump Processes SIAM J. Control Optim. 15 92-119

[5]

Serebrennikova NV(2010)Using Methods of Stochastic Control to Prevent Overloads in Data Transmission Networks Autom. Remote Control 71 1804-1815

[6]

Boel R(2005)Flow Control as a Stochastic Optimal Control Problem with Incomplete Information Probl. Inf. Transm. 41 150-170

[7]

Varaia P(undefined)undefined undefined undefined undefined-undefined

[8]

Miller AB(undefined)undefined undefined undefined undefined-undefined

[9]

Miller BM(undefined)undefined undefined undefined undefined-undefined

[10]

Avrachenkov KE(undefined)undefined undefined undefined undefined-undefined

← 1 2 →