W. Lin and B. Veeravalli (Singapore)
Object replication, I/O cost, communication cost, alloca tion scheme, request window
In this paper, we propose an adaptive object replication al gorithm suitable for distributed network systems and carry out implementations to quantify its performance. We first present a theoretical framework by using a mathematical cost model that considers all the costs associated with ser vicing a request, i.e., I/O cost, control-message trans ferring cost, and data-message transferring cost. Using this cost model, we develop an efficient and auto-adaptive object replication algorithm, referred to as Adaptive Dis tributed Request Window (ADRW) algorithm. Our ob jective is to dynamically adjust the allocation schemes of objects based on the decision of ADRW algorithm, i.e., whether the system is read-intensive or write-intensive, so as to minimize the total servicing cost of the arriving re quests. Our experimental results convincingly demonstrate that the proposed algorithm is adaptive and is superior to several related algorithms in the literature in terms of the average cost of servicing a request.
Important Links:
Go Back
