This Article 
 Bibliographic References 
 Add to: 
Optimal Allocation for Partially Replicated Database Systems on Ring Networks
December 1994 (vol. 6 no. 6)
pp. 975-982

Considers a distributed database with partial replication of data objects located on a ring network. Certain placements of replicated objects are shown to optimize the probability of read-only success and the probability of write-only success. We also obtain optimal placements for k-terminal reliability and expected minimal path length for read-only and write-only operations.

[1] A. El Abbadi and S. Toueg, "Maintaining availability in partitioned replicated databases,"ACM Trans. Database Syst., vol. 14, no. 2, pp. 264-290, June 1989.
[2] H. Attiya, M. Snir, and M. K. Warmuth, "Computing on an anonymous ring,"J. ACM, vol. 35, no. 4, pp. 845-875, 1988.
[3] P. A. Bernstein and N. Goodman, "Serializability theory for replicated databases,"J. Comput. Syst. Sci., vol. 31, no. 3, pp. 355-374, 1986.
[4] R. G. Casey "Allocation of copies in a file in an information network," inProc. 1972 Spring Joint Comput. Conf., 1972.
[5] S. Ceri, G. Martella, and G. Pelagatti, "Optimal file allocation in a computer network: A solution method based on the knapsack problem,"Comput. Networks, vol. 6, no. 5, pp. 345-357, 1982.
[6] C. J. Colbourn,The Combinatorics of Network Reliability. Oxford, U.K.: Oxford University Press, 1987.
[7] S. B. Davidson, "Optimism and consistency in partitioned distributed database systems,"ACM Trans. Database Syst., vol. 14, no. 2, pp. 341-370, 1984.
[8] L. W. Dowdy, and D. V. Foster, "Comparative models of the file ss-signment problem,"ACM Comput. Surveys, vol. 14, no. 2, pp. 287-313, June 1982.
[9] D. L. Eager and K. C. Sevcik, "Achieving robustness in distributed data-base systems,"ACM Trans. Database Syst., vol. 8, no. 3, pp. 354-381, Sept. 1983.
[10] M.L. Fisher and D.S. Hochbaum, "Database location in computer networks,"J. ACM, vol 27, no. 4, pp. 718-735, Oct. 1980.
[11] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[12] O. Goldreich and L. Shrira, "On the complexity of computation in the presence of link failures: The case of a ring,"Distrib. Computing, vol. 5, pp. 121-131, 1991.
[13] O. Kariv and S. L. Hakimi, "An algorithmic approach to network location problems. II: Thep-medians,"SIAM J. Applied Mathematics, vol. 37, no. 3, pp. 539-560, 1979.
[14] S. Mahmoud and J. S. Riordan, "Optimal allocation of resources in distributed information networks,"ACM Trans. Database Syst., vol. 1, no. 1, pp. 66-78, Mar. 1976.
[15] H. L. Morgan and K. D. Levin, "Optimal program and data locations in computer networks,"Commun. ACM, vol. 20, no. 5, pp. 315-322, May 1977.
[16] C. V. Ramamoorthy and B. W. Wah, "The isomorphism of simple file allocation,"IEEE Trans. Comput., vol. C-32, no. 3, pp. 221-232, 1983.
[17] A. B. Stephens, K. Humenik, and Y. Yesha, "Allocation and partial replication for database systems on ring networks," submitted toJ. Comput. Software Eng.
[18] O. Wolfson and A. Milo, "The multicast policy and its relationship to replicated data placement,"ACM Trans. Databases, vol. 16, pp. 181-205, 1991.

Index Terms:
replicated databases; token networks; probability; optimisation; reliability; distributed databases; software reliability; storage allocation; resource allocation; optimal allocation; partially replicated database systems; ring networks; distributed database; data objects; object placement; read-only success probability; write-only success probability; optimal placements; k-terminal reliability; expected minimal path length; ring topology
A.B. Stephens, Y. Yesha, K. Humenik, "Optimal Allocation for Partially Replicated Database Systems on Ring Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 6, pp. 975-982, Dec. 1994, doi:10.1109/69.334886
Usage of this product signifies your acceptance of the Terms of Use.