The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy

DOI10.1007/s446-002-8031-5zbMath1448.68040OpenAlexW2002043779WikidataQ58329976 ScholiaQ58329976MaRDI QIDQ5138372

Irwin S. Pressman, Jan K. Pachl, Stephen A. Cook

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s446-002-8031-5

zbMATH Keywords

optimizationdynamic programmingNP-completenessdata replication

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Exact approaches for static data segment allocation problem in an information network ⋮ Facility location models to locate data in information networks: a literature review

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Database Location in Computer Networks
• Locating replicas of a database on a network

This page was built for publication: The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy