Skip to main content
SpringerLink
Log in

Configuration of fully replicated distributed database system over wide area networks

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The cost and performance of a distributed database system (DDS) depends on data distribution and database server configuration across the network. An inappropriate allocation of data and database severs could result in a DDS which is either too costly or unacceptably slow. This paper models the optimal configuration of fully replicated DDS. The problem is formulated as an integer linear programming problem and a solution procedure based on Lagrangian relaxation and subgradient optimization is proposed. The proposed solution procedure was computationally tested under various scenarios regarding communication, processor costs, and transaction characteristics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Allen et al., A generalization of Polyak's convergence result for subgradient optimization, Math. Progr. 37 (1987) 309–317.

    Google Scholar 

  2. P.M.G. Apers, Query processing and data allocation in distributed database systems, Mathematisch Centrum (1983).

  3. P.A. Bernstein, M. Goodman, J.B. Rothnie and C.A. Papadimitriou, The concurrency control mechanism of SDD-1: a system for distributed databases (the fully redundant case), IEEE Trans. Software Eng. SE-4 (1978) 154–168.

    Google Scholar 

  4. R.G. Casey, Allocation of copies of a file in an information network,Proc. AFIPS 1972 Spring Joint Computer Conf. (1972) pp. 617–625.

  5. W.W. Chu, Optimal file allocation in multiple computer systems, IEEE Trans. Comput. C-18 (1969) 885–889.

    Google Scholar 

  6. D.W. Cornell and P.S. Yu, Relation assignment in distributed transaction processing environment,Proc. 7th Int. Conf. on Distributed Computing Systems (1987) pp. 50–55.

  7. L.W. Dowdy and D.V. Foster, Comparative models of the file assignment problem, ACM Comput. Surveys 14 (1982) 287–313.

    Google Scholar 

  8. D. Erlenkotter, A dual-based procedure for uncapacitated plant location, Oper. Res. 26 (1978) 992–1009.

    Google Scholar 

  9. M.L. Fisher, Lagrangian relaxation method for solving integer programming, Manag. Sci. 27 (1981) 1–18.

    Google Scholar 

  10. B. Gavish, Topological design of centralized computer networks: formulations and algorithms, Network 12 (1982) 355–377.

    Google Scholar 

  11. B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, J. ACM 30 (1984) 118–132.

    Google Scholar 

  12. B. Gavish, Models for configuring large-scale distributed computing systems, AT&T Tech. J. 64 (1985) 491–532.

    Google Scholar 

  13. B. Gavish, Optimization models for configuring distributed computing systems, IEEE Trans. Comput. 36 (1987) 773–793.

    Google Scholar 

  14. B. Gavish and S.L. Hantler, An algorithm for optimal route selection in SNA networks, IEEE Trans. Commun. COM-31 (1983) 1154–1161.

    Google Scholar 

  15. B. Gavish and H. Pirkul, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Math. Progr. 31 (1985) 78–105.

    Google Scholar 

  16. B. Gavish and H. Pirkul, Computer and database location in distributed computing systems, IEEE Trans. Comput. C-35 (1986) 583–590.

    Google Scholar 

  17. B. Gavish and H. Pirkul, Distributed computer system design for large decentralized organizations,Proc. Int. Conf. on Information Systems (1986) pp. 116–135.

  18. B. Gavish and M.W. Suh, Optimal configuration of two-tiered distributed database systems, Working Paper (1990).

  19. A.M. Geoffrion and R. McBride, Lagrangian relaxation applied to capacitated plant location problem, Trans. AIIE 10 (1978) 40–47.

    Google Scholar 

  20. H.J. Greenberg and W.P. Pierskalla, Surrogate mathematical programming, Oper. Res. 18 (1970) 924–939.

    Google Scholar 

  21. M. Held and R.M. Karp, The travelling salesman problem and minimum spanning trees, Oper. Res. 18 (1970) 1138–1162.

    Google Scholar 

  22. M. Held, P. Wolfe and H.P. Crowder, Validation of subgradient optimization, Math. Progr. 6 (1974) 62–88.

    Google Scholar 

  23. K.B. Irani and N.G. Khabbaz, File allocation in a distributed computer communications network, IEEE Trans. Comput. C-31 (1982) 419–434.

    Google Scholar 

  24. L.J. Lanning and M.S. Leonard, File allocation in a distributed computer communication network, IEEE Trans. Comput. C-32 (1983) 824–835.

    Google Scholar 

  25. S. Mahmoud and J.S. Riordon, Optimal allocation of resources in distributed information networks, ACM Trans. Database Systems 1 (1976) 66–78.

    Google Scholar 

  26. H.L. Morgan and K.D. Levin, Optimal program and data locations in computer networks, Commun. ACM 20 (1977) 315–321.

    Google Scholar 

  27. D. Secca and G. Wiederhold, Database partitioning in a cluster of processors, ACM Trans. Database Systems 10 (1985) 29–56.

    Google Scholar 

  28. C.T. Yu et al., File allocation in distributed database with interaction with files,Proc. Int. Conf. on Very Large Databases (1983) pp. 248–259.

  29. B.W. Wah, File placement on distributed computer systems, IEEE Trans. Comput. C-4 (1984) 23–32.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Owen Graduate School of Management, Vanderbilt University, 37203, Nashville, TN, USA

    Bezalel Gavish

  2. Department of Administrative Sciences, Naval Postgraduate School, 93943, Monterey, CA, USA

    Myung W. Suh

Authors
  1. Bezalel Gavish
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Myung W. Suh
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gavish, B., Suh, M.W. Configuration of fully replicated distributed database system over wide area networks. Ann Oper Res 36, 167–191 (1992). https://doi.org/10.1007/BF02094329

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02094329

Keywords

Search

Navigation