A Dynamic Optimization Model for Distributed Databases

K. Dan Levin and Howard Lee Morgan
Additional contact information
K. Dan Levin: University of Pennsylvania, Philadelphia, Pennsylvania
Howard Lee Morgan: University of Pennsylvania, Philadelphia, Pennsylvania

Operations Research, 1978, vol. 26, issue 5, 824-835

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

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.5.824 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:26:y:1978:i:5:p:824-835

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().