By Topic

Leveraging Distance Table to Accelerate Data Location in Large-Scaled Data Intensive Grid Environment*

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)
Wei Ye ; Fudan University, P.R. China ; Yuan Wang ; Ning Gu

Data Intensive Grid aims at efficient data sharing in large scale distributed data storage environment, which is a promising way to improve data and software viability. But there are still numerous challenges to extend the application to a large range, like tens of thousands of users distributed in all over the world. Taking physical distances between distributed nodes into account, effective and efficient data and object location is one of the most critical issues. In this paper, we introduce distance table to data and object Location and routing mechanism, and propose a self-organizing, scalable, robust wide-area infrastructure that can efficiently routes requests to content in the presence of heavy load and considering actual distance between nodes. Simulation experiments show that our solution has a satisfying performance especially under heavy network traffic.

Published in:

Computer and Information Technology, 2006. CIT '06. The Sixth IEEE International Conference on

Date of Conference:

Sept. 2006