Dynamic file assignment in a computer network

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.