IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v37y1990i1p165-181.html
   My bibliography  Save this article

Optimal file allocation and report assignment in distributed information networks

Author

Listed:
  • R. Ramesh
  • B. Ryan

Abstract

Distributed database systems is a current design practice in database architecture. These systems are used by corporations that are served by a network of computers. In this research, we model the problem of allocation of copies of files and the assignment of reports to sites in a distributed computer network. This is a 0–1 integer programming problem, and we present optimal and heuristic solution procedures in this article. We develop their underlying theory and present computational results. An application in which the proposed algorithms have been used to solve the design problem is presented. The results show that the proposed methodology is viable and efficient in solving real‐world problems, and could provide significant savings in cost over a centralized design. We also present extensions of this research and directions for future investigations in this area.

Suggested Citation

  • R. Ramesh & B. Ryan, 1990. "Optimal file allocation and report assignment in distributed information networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 165-181, February.
    • Handle: RePEc:wly:navres:v:37:y:1990:i:1:p:165-181
    DOI: 10.1002/1520-6750(199002)37:13.0.CO;2-T
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199002)37:13.0.CO;2-T
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199002)37:13.0.CO;2-T?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
    ---><---

    References listed on IDEAS

    as
    1. Pirkul, Hasan, 1986. "An integer programming model for the allocation of databases in a distributed computer system," European Journal of Operational Research, Elsevier, vol. 26(3), pages 401-411, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Goutam Sen & Mohan Krishnamoorthy & Narayan Rangaraj & Vishnu Narayanan, 2016. "Facility location models to locate data in information networks: a literature review," Annals of Operations Research, Springer, vol. 246(1), pages 313-348, November.
    2. Basu, Amit, 1998. "Perspectives on operations research in data and knowledge management," European Journal of Operational Research, Elsevier, vol. 111(1), pages 1-14, November.
    3. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    4. LeBlanc, Larry J. & Shtub, Avraham & Anandalingam, G., 1999. "Formulating and solving production planning problems," European Journal of Operational Research, Elsevier, vol. 112(1), pages 54-80, January.
    5. Maciej Drwal & Jerzy Jozefczyk, 2014. "Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding," Annals of Operations Research, Springer, vol. 222(1), pages 261-277, November.
    6. T Bektaş & J-F Cordeau & E Erkut & G Laporte, 2008. "A two-level simulated annealing algorithm for efficient dissemination of electronic content," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1557-1567, November.
    7. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Özlem Karsu & Meral Azizoğlu, 2014. "Bicriteria multiresource generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(8), pages 621-636, December.
    9. Joseph B. Mazzola & Steven P. Wilcox, 2001. "Heuristics for the multi‐resource generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 468-483, September.

    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:wly:navres:v:37:y:1990:i:1:p:165-181. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.