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

被引:4
作者
Amiri, A [1 ]
机构
[1] Oklahoma State Univ, Dept MSIS, Coll Business 210, Stillwater, OK 74078 USA
关键词
planning; distributed database system; database servers; mathematical programming; heuristic;
D O I
10.1016/j.ins.2003.03.010
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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. (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码:229 / 245
页数:17
相关论文
共 16 条
[1]   SURVEY OF VARIOUS TACTICS FOR GENERATING LAGRANGIAN MULTIPLIERS IN THE CONTEXT OF LAGRANGIAN DUALITY [J].
BAZARAA, MS ;
GOODE, JJ .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1979, 3 (04) :322-338
[2]   Optimal binary vote assignment for replicated data [J].
Chang, HK ;
Yuan, SM .
JOURNAL OF SYSTEMS AND SOFTWARE, 2000, 53 (01) :73-82
[3]   Enterprise network planning and design: methodology and application [J].
Drakopoulos, E .
COMPUTER COMMUNICATIONS, 1999, 22 (04) :340-352
[5]   FILE ALLOCATION PROBLEM - COMPARISON OF MODELS WITH WORST CASE AND AVERAGE COMMUNICATION DELAYS [J].
GHOSH, D ;
MURTHY, I ;
MOFFETT, A .
OPERATIONS RESEARCH, 1992, 40 (06) :1074-1085
[6]   APPLICATION OF A CROSS DECOMPOSITION ALGORITHM TO A LOCATION AND ALLOCATION PROBLEM IN DISTRIBUTED SYSTEMS [J].
LEE, CY .
COMPUTER COMMUNICATIONS, 1995, 18 (05) :367-377
[7]   Designing a distributed database on a local area network: a methodology and decision support system [J].
Lee, H ;
Park, YK ;
Jang, G ;
Huh, SY .
INFORMATION AND SOFTWARE TECHNOLOGY, 2000, 42 (03) :171-184
[8]   A high performance distributed database system for enhanced Internet services [J].
Peddemors, AH ;
Hertzberger, LO .
FUTURE GENERATION COMPUTER SYSTEMS, 1999, 15 (03) :407-415
[10]   ALLOCATING PRIMARY AND BACKUP COPIES OF DATABASES IN DISTRIBUTED COMPUTER-SYSTEMS - A MODEL AND SOLUTION PROCEDURES [J].
PIRKUL, H ;
HOU, YP .
COMPUTERS & OPERATIONS RESEARCH, 1989, 16 (03) :235-245