IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v26y1978i5p824-835.html
   My bibliography  Save this article

A Dynamic Optimization Model for Distributed Databases

Author

Listed:
  • K. Dan Levin

    (University of Pennsylvania, Philadelphia, Pennsylvania)

  • Howard Lee Morgan

    (University of Pennsylvania, Philadelphia, Pennsylvania)

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.

Suggested Citation

  • K. Dan Levin & Howard Lee Morgan, 1978. "A Dynamic Optimization Model for Distributed Databases," Operations Research, INFORMS, vol. 26(5), pages 824-835, October.
    • Handle: RePEc:inm:oropre:v:26:y:1978:i:5:p:824-835
    DOI: 10.1287/opre.26.5.824
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.26.5.824
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.26.5.824?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:26:y:1978:i:5:p:824-835. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.