A Scalable Evenly Distributed Replica Location Mechanism
Xiaohua Song, Heqing Huang, Yuanda Cao · 2007
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.