By Topic

Control of connected Markov chains. Application to congestion avoidance in the Internet

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Miller, A. ; Inst. for Inf. Transm. Problems, Moscow, Russia ; Miller, B.

The article considers the optimal control for the system of finite number of controlled connected Markov chains (CMC). Such models come from queuing systems with many service lines and/or from the control of resources of multiple connected dams. The state of such CMC is represented as a tensor of the depth d; where d is the number of controlled chains. This tensor form is much more convenient for derivation of the dynamic programming equation. We give a tensor form for the control problems arising in the router control which is aimed to the congestion avoidance with the aid of two telecommunication lines having different properties and cost of services.

Published in:

Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on

Date of Conference:

12-15 Dec. 2011