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

Information Sciences

Volumn 164, Issue 1-4, 2004, Pages 229-245

  Amiri, Ali ^a  

^a OKLAHOMA STATE UNIVERSITY   (United States)

Author keywords

Database servers; Distributed database system; Heuristic; Mathematical programming; Planning

Indexed keywords

COSTS; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; MULTIMEDIA SYSTEMS; RELIABILITY; SERVERS; TELECOMMUNICATION NETWORKS;

DATABASE SERVERS; DISTRIBUTED DATABSE SYSTEMS; PLANING HOROIZONS; SERVER CAPACITY; SOLUTION QUALITY;

DATABASE SYSTEMS;

EID: 3042757132     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2003.03.010     Document Type: Article

References (16)

1. Bazaraa M., Goode J. A survey of various tactics for generating Lagrangean multipliers in the context of lagrangean duality. European Journal of Operational Research. 3:1979;322-328.
2. Chang H-K., Yuan S-M. Optimal binary vote assignment for replicated data. Journal of Systems and Software. 53(1):2000;73-82.
3. Drakopoul E. Enterprise network planning and design: methodology and application. Computer Communications. 22(4):1999;340-352.
4. Gavish B. On obtaining the 'Best' multipliers for a Lagrangean relaxation for integer programming. Computers and Operations Research. 5:1978;55-71.
5. Ghosh D., Murthy I., Moffett A. File allocation problem: comparison of models with worst case and average communication delays. Operations Research. 40(6):1992;1074-1085.
6. Lee C. Application of a cross decomposition algorithm to a location and allocation problem in distributed systems. Computer Communications. 18(5):1995;367-377.
7. Lee H., Park Y-K., Jang G., Huh S-Y. Designing a distributed database on a local area network: a methodology and decision support system. Information and Software Technology. 42(3):2000;171-184.
8. Peddemors A.J.H., Hertzberger L.O. A high performance distributed database system for enhanced Internet services. Future Generation Computer Systems. 15(3):1999;407-415.
9. Pirkul H. Efficient algorithms for the capacitated concentrator location problem. Computers and Operations Research. 14(3):1987;197-208.
10. Pirkul H. Configuring distributed computer systems with online database backups. Decision Support Systems. 3:1987;37-46.
11. Pirkul H., Hou Y. Allocating primary and back-up copies of databases in distributed computer systems: a model and solution procedures. Computers and Operations Research. 16(3):1989;235-245.
12. Poljack B. A general method of solving extremum problems. Soviet Mathematics Doklady. 8:1967;593-597.
13. Post G., Kagan A. Database management systems: design considerations and attribute facilities. Journal of Systems and Software. 56(2):2001;183-193.
14. Ram S., Narasimhan S. Database Allocation in a distributed environment: incorporating a concurrency control mechanism and queueing costs. Management Science. 40(8):1994;969-983.
15. Scotney R., McClean S., Rodgers M. Optimal and efficient integration of heterogeneous summary tables in a distributed database. Data and Knowledge Engineering. 29(3):1999;337-350.
16. Shekhar S., Wu W. Optimal placement of data replicas in distributed database with majority voting protocol. Theoretical Computer Science. 258(1-2):2001;555-571.