The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—In this paper, we address the performance of distributed database systems with buffer constraints. Specifically, our objective is to design and analyze efficient data allocation and replication strategies to minimize the total servicing cost for an arbitrary read/write request sequence, under finite buffer constraints of the nodes in the system. When the available buffer space in a node is not enough to store a copy of an object, the decision has to be made on whether or not we should evict one or more objects in use to give room for the new object copy. In this paper, we design and analyze the data replication strategies with the model of Dynamic Window Mechanism (DWM) algorithm jointly implemented with different types of object replacement strategies (No Replacement, LRU, and LFU) commonly found in practice. We consider situations wherein the object sizes are identical as well as heterogeneous. We will show the impact on the performance of the allocation and replication strategies due to the limited local database buffer capacities. We analyze and quantify theoretically (using competitive analysis) the performances of all the proposed algorithms. Further, we perform rigorous simulation experiments to validate the findings with respect to several influencing parameters. Several useful conclusions are drawn based on the experimental results and we highlight the usefulness of the algorithms under different situations.</p>
Object allocation, distributed database system, competitiveness, replacement algorithms, caching, communication cost.

W. Lin, B. Veeravalli and X. Gu, "Practically Realizable Efficient Data Allocation and Replication Strategies for Distributed Databases with Buffer Constraints," in IEEE Transactions on Parallel & Distributed Systems, vol. 17, no. , pp. 1001-1013, 2006.
88 ms
(Ver 3.3 (11022016))