Please use this identifier to cite or link to this item: https://doi.org/10.1109/TPDS.2006.127
Title: Practically realizable efficient data allocation and replication strategies for distributed databases with buffer constraints
Authors: Gu, X.
Lin, W.
Veeravalli, B. 
Keywords: Caching
Communication cost
Competitiveness
Distributed database system
Object allocation
Replacement algorithms
Issue Date: Sep-2006
Source: Gu, X., Lin, W., Veeravalli, B. (2006-09). Practically realizable efficient data allocation and replication strategies for distributed databases with buffer constraints. IEEE Transactions on Parallel and Distributed Systems 17 (9) : 1001-1013. ScholarBank@NUS Repository. https://doi.org/10.1109/TPDS.2006.127
Abstract: 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. © 2006 IEEE.
Source Title: IEEE Transactions on Parallel and Distributed Systems
URI: http://scholarbank.nus.edu.sg/handle/10635/57101
ISSN: 10459219
DOI: 10.1109/TPDS.2006.127
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

8
checked on Dec 13, 2017

WEB OF SCIENCETM
Citations

3
checked on Dec 13, 2017

Page view(s)

27
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.