| Article ID: | iaor19921617 |
| Country: | Switzerland |
| Volume: | 36 |
| Issue: | 1 |
| Start Page Number: | 167 |
| End Page Number: | 192 |
| Publication Date: | May 1992 |
| Journal: | Annals of Operations Research |
| Authors: | Gavish Bezalel, Suh Myung W. |
| Keywords: | networks |
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 servers 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.