On the connections between optimal control, regulation and dynamic network routing
DOI:
https://doi.org/10.26636/jtit.2003.3.189Keywords:
tabilization, nonlinear control, optimal control, dynamic programming, data networks, routing algorithmsAbstract
he paper is devoted to studying general features of dynamic network routing problems. It is shown that these problems may be interpreted as receding horizon optimal control problems or simply regulation problems. In the basic formulation it is assumed, that the nodes have no dynamics and the only goal of the optimization mechanism is to find the shortest paths from the source to the destination nodes. In this problem the optimization mechanism (i.e. the Bellman-Ford algorithm) may be interpreted as a receding horizon optimal control routine. Moreover, there is one-to-one correspondence between the Bellman optimal cost-to-go function in the shortest path problem and the Lyapunov function in the regulation problem. At the end some results of the application of the routing optimization algorithm to an inverted pendulum regulation problem are presented.
Downloads
References
[1] D. Bertsekas and R. Gallager, Data Networks. Englewood-Cliffs: Prentice-Hall, 1992.
View in Google Scholar
[2] D. E. Comer, Internetworking with TCP/IP 4/e. Vol. I: Principles, Protocols, and Architecture. Englewood Cliffs: Prentice-Hall, 2000.
View in Google Scholar
[3] A. Isidori, Nonlinear Control Systems. London: Springer, 1995.
View in Google Scholar
[4] A. Karbowski, E. Niewiadomska-Szynkiewicz, Red., Obliczanie równoległe i rozproszone. Warszawa: Oficyna Wydawnicza Politechniki Warszawskiej, 2001.
View in Google Scholar
[5] G. Kreisselmeier and T. Birkholzer, "Numerical nonlinear regulator design", IEEE Trans. Autom. Contr., vol. 39, pp. 33-46, 1994.
View in Google Scholar
[6] D. G. Luenberger, Introduction to Dynamic Systems: Theory, Models and Applications. New York: Wiley, 1979.
View in Google Scholar
Downloads
Submitted
Published
Issue
Section
License
Copyright (c) 2003 Journal of Telecommunications and Information Technology

This work is licensed under a Creative Commons Attribution 4.0 International License.