Industrial Electronics and Applications (ISIEA), 2013 IEEE Symposium on , 2013-09-22

Title : ( Minimizing access cost of replicas in tree data grids for read-only objects )

Authors: YASER MANSOURI , Reza Monsefi ,

Access to full-text not allowed by authors

Citation: BibTeX | EndNote

Abstract

Replication of objects is a popular solution to reduce access cost, to increase network usage and objects availability. In order to achieve these goals Optimal Number of Replicas (ONR), Greedy and Simple Greedy algorithms with suitable time complexity, are proposed. Our algorithms are evaluated in three performance parameters: Normalized Access Cost, Effective Network Usage and Percentage of Local Access. Results from experiments reveal that the proposed algorithms have significant improvements in the decreasing access cost, increasing network usage, and enhancing objects accessibility. The results also show that the ONR algorithm has the better performance than the Greedy algorithm, in turn, better than the Simple Greedy algorithm.

Keywords

, Tree Data Grids, Replicas, Optimal Placement, Network Usage, ONR Algorithm.
برای دانلود از شناسه و رمز عبور پرتال پویا استفاده کنید.

@inproceedings{paperid:1042104,
author = {MANSOURI, YASER and Monsefi, Reza},
title = {Minimizing access cost of replicas in tree data grids for read-only objects},
booktitle = {Industrial Electronics and Applications (ISIEA), 2013 IEEE Symposium on},
year = {2013},
location = {Kuching},
keywords = {Tree Data Grids; Replicas; Optimal Placement; Network Usage; ONR Algorithm.},
}

[Download]

%0 Conference Proceedings
%T Minimizing access cost of replicas in tree data grids for read-only objects
%A MANSOURI, YASER
%A Monsefi, Reza
%J Industrial Electronics and Applications (ISIEA), 2013 IEEE Symposium on
%D 2013

[Download]