Abstract
Decentralized dynamic routing in communication networks is dealt with in the paper. A procedure to find the optimal solution over a finite control horizon is given and then the structure of the optimal control law is investigated. Finally, a receding horizon control scheme is proposed whose application is made possible by the existence of a sufficient statistic.
Preview
Unable to display preview. Download preview PDF.
References
A. Segall, The modeling of Adaptive Routing in Data Communication Networks, IEEE Trans. Comm., Vol. COM-25, pp. 85–95, 1977.
F.H. Moss and A. Segall, An Optimal Control Approach to Dynamic Routing in Networks, IEEE Trans. Autom. Control, Vol. AC-27, pp. 329–339, 1982.
P.E. Sarachik and U. Ozgüner, On Decentralized Dynamic Routing for Congested Traffic Networks, IEEE Trans. Autom. Control, Vol. AC-27, pp. 1233–1238, 1982.
G. Bartolini, G. Casalino, F. Davoli, R. Minciardi and R. Zoppoli, A Team Theoretical Approach to Routing and Multiple Access in Data Communication Networks, Proc. of the 3rd IFAC/IFORS Symposium on Large Scale System, Warsaw, 1983.
Y.C. Ho and K.C. Chu, Team Decision Theory and Information Structures in Optimal Control Problems — Part. I, IEEE Trans. Autom. Control, Vol. AC-17, pp. 15–22, 1972.
G. Casalino, F. Davoli, R. Minciardi and R. Zoppoli, Decentralized Dynamic Routing in Data Communication Networks, Proc. Mediterranean Elettrotechnical Conference, Athens, 1983.
G. Casalino, F. Davoli, R. Minciardi and R. Zoppoli, On the Structure of Decentralized Dynamic Routing Strategies, Proc. 22nd IEEE Conf. on Dec. & Control, San Antonio, Texas, pp. 472–476, 1983.
G. Casalino, F. Davoli, R. Minciardi and R. Zoppoli, Sufficient Statistics in Team Control Problems with a Common Past, Proc. 21st IEEE Conf. on Dec. & Control, Orlando, Florida, pp. 186–190, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Casalino, G., Davoli, F., Minciardi, R., Zoppoli, R. (1986). A feasible solution to dynamic team problems with a common past and application to decentralized dynamic routing. In: Archetti, F., Di Pillo, G., Lucertini, M. (eds) Stochastic Programming. Lecture Notes in Control and Information Sciences, vol 76. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006870
Download citation
DOI: https://doi.org/10.1007/BFb0006870
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16044-1
Online ISBN: 978-3-540-39729-8
eBook Packages: Springer Book Archive