A Dynamic Optimization Model for Distributed Databases

We present a dynamic programming formulation for solving the problem of locating files in heterogeneous, distributed computer networks. The model presented permits the access rates for information from files to vary over time, takes into account the fact that programs accessing files may only be permitted at certain nodes, and solves this general T-period problem. Special features are used to limit the growth of the state space so that a computationally feasible algorithm results. Finally, we present an example to illustrate the use of the algorithm.