The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
From MaRDI portal
Publication:5138372
Recommendations
- Locating replicas of a database on a network
- Placement of data replicas for optimal data availability in ring networks
- Optimal allocation for partially replicated database systems on tree- based networks
- Approximation algorithms for data placement in arbitrary networks
- Database placement in communication networks for minimizing the overall transmission cost
Cites work
- 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
- Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 177557 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Locating replicas of a database on a network
Cited in
(4)- Exact approaches for static data segment allocation problem in an information network
- Facility location models to locate data in information networks: a literature review
- Optimal placement of data replicas in distributed database with majority voting protocol
- Placement of data replicas for optimal data availability in ring networks
This page was built for publication: The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138372)