Skip to main content

A feasible solution to dynamic team problems with a common past and application to decentralized dynamic routing

  • Part. II — Stochastic Optimization
  • Conference paper
  • First Online:
Stochastic Programming

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 76))

  • 170 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Segall, The modeling of Adaptive Routing in Data Communication Networks, IEEE Trans. Comm., Vol. COM-25, pp. 85–95, 1977.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. G. Casalino, F. Davoli, R. Minciardi and R. Zoppoli, Decentralized Dynamic Routing in Data Communication Networks, Proc. Mediterranean Elettrotechnical Conference, Athens, 1983.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

F. Archetti G. Di Pillo M. Lucertini

Rights and permissions

Reprints 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

Publish with us

Policies and ethics