A coordinated planning model for the design of a distributed database system

Authors:
Ali Amiri
Affiliations:
Departmemt of MSIS, 210 College of Business, Oklahoma State University, Stillwater, OK
Venue:
Information Sciences—Informatics and Computer Science: An International Journal
Year:
2004

Citing 11
Cited 1

Efficient algorithms for the capacitated concentrator location problem

Computers and Operations Research
Configuring distributed computer systems with online database backups

Decision Support Systems
Allocating primary abd back-up copies of databases in distributed computer systems: a model and solution procedures

Computers and Operations Research
File allocation problem: comparison of models with worst case and average communication delays

Operations Research
Database allocation in a distributed environment: incorporating a concurrency control mechanism and queuing costs

Management Science
Optimal and efficient integration of heterogeneous summary tables in a distributed database

Data & Knowledge Engineering
Optimal binary vote assignment for replicated data

Journal of Systems and Software - Special issue on empirical studies of software development and evolution
Database management systems: design considerations and attribute facilities

Journal of Systems and Software
Optimal placement of data replicas in distributed database with majority voting protocol

Theoretical Computer Science
Application of a cross decomposition algorithm to a location and allocation problem in distributed systems

Computer Communications
Enterprise network planning and design: methodology and application

Computer Communications

A near-optimal database allocation for reducing the average waiting time in the grid computing environment

Information Sciences: an International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

Motivated by a problem faced by a multimedia entertainment retailer, we explore the problem of planning the design of a distributed database system. The problem consists of planning the design/expansion of the distributed database system by introducing new database servers and retiring possibly some existing ones in order to reduce telecommunication costs for processing user queries and server acquisition, operations and maintenance cost in a multiperiod environment where user processing demand varies over time. We develop a mathematical programming model and an effective solution approach to determine the best decisions regarding acquisition and retirement of database servers and assignment of user processing demand to the servers over time. Through a computational study, we investigate the impact of important parameters such as length of the planning horizon and demand growth on the solution quality and utilization of server capacity and examine the effectiveness of the solution approach in comparison with the commercial package LINDO. We also discuss some extensions to the problem as directions for future research.