By Topic

An Effective Replica Location Algorithm Based on Routing-Forward in Data Grid

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Runqun Xiong ; Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China ; Junzhou Luo ; Aibo Song

Data Grid is a kind of wide-area, distributed storage system, which can provide huge storage capacity. There are millions of files in data grid, distributed in hundreds of geographically dispersed storage resources. Given a unique logical identifier for desired content, replica location service can be used to determine the physical locations of one or more copies of this content. This paper analyzes the existing replica location methods, points out their insufficiency and then proposes an effective replica location algorithm based on Routing-Forward mechanism. Meanwhile, we analyze the time cost and space cost of all these algorithms, the result shows that the Routing-Forward algorithm costs lest time and tolerable space. As a conclusion, Routing-Forward algorithm is an effective replica location algorithm in Data Grid.

Published in:

ChinaGrid Conference (ChinaGrid), 2010 Fifth Annual

Date of Conference:

16-18 July 2010