Configuring distributed computer systems with online database backups

Abstract Designers of distributed computer systems face many complex decisions in determining the system configuration. These decisions involve location of computing resources, determination of databases and allocation of one or more copies of these databases among computing facilities. This paper deals with the configuration problem for a class of organizations that are critically dependent on the availability of their computer systems, and have widely dispersed operations with localized information needs. These organizations require online back-up copies of their databases in order to continue their operations in case of failure of a computer installation or a communication channel. An integer programming formulation of the problem is presented and an effective solution procedure is developed. Computational experience with this procedure is reported.

[1]  Hasan Pirkul.  Configuring distributed computer systems , 1986 .

[2]  Hasan Pirkul,et al.  An integer programming model for the allocation of databases in a distributed computer system , 1986 .

[3]  Hasan Pirkul,et al.  Computer and Database Location in Distributed Computer Systems , 1986, IEEE Transactions on Computers.

[4]  Wesley W. Chu,et al.  Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[5]  K. Dan Levin,et al.  Optimal program and data locations in computer networks , 1977, CACM.

[6]  M. Bazaraa,et al.  A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality , 1979 .

[7]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[8]  Dorit S. Hochbaum,et al.  Database Location in Computer Networks , 1980, JACM.

[9]  F. Warren McFarlan,et al.  Corporate information systems management : text and cases , 1988 .

[10]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[13]  B. Gavish.  Models for configuring large-scale distributed computing systems , 1985, AT&T Technical Journal.

[14]  Peter P. Chen,et al.  Optimal Design of Distributed Information Systems , 1980, IEEE Transactions on Computers.

[15]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .

[16]  Erol Gelenbe,et al.  Optimization of the Number of Copies in a Distributed Data Base , 1981, IEEE Trans. Software Eng..

[17]  H. Pirkul,et al.  Capacitated Multiple Item Ordering Problem with Quantity Discounts , 1985 .

[18]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[19]  R. G. Casey,et al.  Allocation of copies of a file in an information network , 1899, AFIPS '72 (Spring).

[20]  Michael S. Leonard,et al.  File Allocation in a Distributed Computer Communication Network , 1983, IEEE Transactions on Computers.

[21]  C. V. Ramamoorthy,et al.  The Isomorphism of Simple File Allocation , 1983, IEEE Transactions on Computers.

[22]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..