A Scalable Evenly Distributed Replica Location Mechanism

Author

Song, Xiaohua ; Huang, Heqing ; Cao, Yuanda

Author_Institution

Beijing Inst. of Technol., Beijing

fYear

2007

fDate

10-12 Dec. 2007

Firstpage

281

Lastpage

285

Abstract

In order to provide better load balancing capability and scalability, a replica location mechanism is designed for data grids based on distributed hash structure which equitably assigns node identifiers. The system is peer-to-peer and hierarchical. It collects the location information of the distributed nodes and assigns optimal identifiers for new node to make the node distribution more even. Global indexes of the system are organized based on the distributed hash structure. Localization of the virtual organization can optimize queries on local indexes. Theoretical analysis and simulations show that it provides good performance, good scalability and load balancing capability for replica locations in data grids.

Keywords

data structures; grid computing; peer-to-peer computing; query processing; resource allocation; data grids; distributed hash structure; distributed replica location mechanism; global indexes; hierarchical system; load balancing; peer-to-peer system; query optimisation; virtual organization; Analytical models; Application software; Availability; Computer science; Costs; Load management; Peer to peer computing; Performance analysis; Reliability theory; Scalability;

fLanguage

English

Publisher

ieee

Conference_Titel

Digital Media and its Application in Museum & Heritages, Second Workshop on

Conference_Location

Chongqing

Print_ISBN

0-7695-3065-6

Type

conf

DOI

10.1109/DMAMH.2007.67

Filename

4414567