loading...
Leveraging Distance Table to Accelerate Data Location in Large-Scaled Data Intensive Grid Environment*
Seoul, Korea September 20-September 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIT.2006.114Sixth IEEE International Conference o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Wei Ye, Fudan University, P.R. China
Yuan Wang, Fudan University, P.R. China
Ning Gu, Fudan University, P.R. China
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.
Index Terms:
Distributed data location; distance table; neighbor table; routing algorithm
Citation:
Wei Ye, Yuan Wang, Ning Gu, "Leveraging Distance Table to Accelerate Data Location in Large-Scaled Data Intensive Grid Environment*," cit, pp.59, Sixth IEEE International Conference on Computer and Information Technology (CIT'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.