Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

An optimal control approach to dynamic routing in networks

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)
Moss, F.H. ; IBM T.J. Watson Research Center, Yorktown Heights, NY, USA ; Segall, A.

This paper explores the application of optimal control theory to the problem of dynamic routing in networks. The approach derives from a continuous state space model for dynamic routing and an associated linear optimal control problem with linear state and control variable inequality constraints. The conceptual form of an algorithm is presented for finding a feedback solution to the optimal control problem when the inputs are assumed to be constant in time. The algorithm employs a combination of necessary conditions, dynamic programming, and linear programming to construct a set of convex polyhedral cones which cover the admissible state space with optimal controls. An implementable form of the algorithm, along with a simple example, is presented for a special class of single destination networks.

Published in:

Automatic Control, IEEE Transactions on  (Volume:27 ,  Issue: 2 )