Method for replica creation in data grids based on complex networks
In order to reduce makespan and storage consumption in data grids, a node selection model for replica creation is proposed. The model is based on the degree distribution of complex networks. We define two candidate replica nodes: a degree-based candidate pool and a frequency-based candidate pool, th...
Saved in:
Published in | Journal of China universities of posts and telecommunications Vol. 17; no. 4; pp. 110 - 115 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Ltd
01.08.2010
College of Computer,Nanjing University of Posts and Telecommunications,Nanjing 210003,China |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In order to reduce makespan and storage consumption in data grids, a node selection model for replica creation is proposed. The model is based on the degree distribution of complex networks. We define two candidate replica nodes: a degree-based candidate pool and a frequency-based candidate pool, through which a degree-based candidate pool is defined in consideration of onsidering the access frequency; a candidate pool-based frequency is also defined. The data replica is copied to the node with the minimum Local cost in the two pools. Further, this paper presents and proves a replica creation theorem. A dynamic multi-replicas creation algorithm (DMRC) is also provided. Simulation results show that the proposed method may simultaneously reduce makespan and data used in space storage consumption. |
---|---|
Bibliography: | data grid, replica creation, complex networks 11-3486/TN TP393.08 TP311.132 ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1005-8885 |
DOI: | 10.1016/S1005-8885(09)60496-9 |