Abstract
We present the models describing a problem of dynamic file allocation in a network of interacting computers and use dynamic programming to solve for the optimal strategies. The problem is treated for the case when the rates of the file requests are known in advance, as well as when only prior statistics is available for these rates. A separation theorem between estimation of the rates and the optimal control is proven, similar to Wonham's separation theorem for linear Gaussian models.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
