Optimal allocation for partially replicated database systems on tree-based networks
A. B. Stephens, Yelena Yesha, Keith Humenik · 1992
The authors consider a partially replicated distributed database located on a tree network each of whose links may fail with a probability p. For small p they derive necessary conditions for optimal placement of copies in order to maximize the probabilities of successful read-only and write-only transactions. These results suggest several heuristics for general networks. Numerical results are presented.>