A hierarchical replica location approach based on cache mechanism and load balancing in data grid

Authors:
Baoyan Song;Yanying Mao;Yan Wang;Derong Shen
Affiliations:
School of Information, Liaoning University, Shenyang, China;School of Information, Liaoning University, Shenyang, China;School of Information, Liaoning University, Shenyang, China;School of Information Science and Engineering, Northeastern University, Shenyang, China
Venue:
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Year:
2008

Citing 4
Cited 0

A model, analysis, and protocol framework for soft state-based communication

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Giggle: a framework for constructing scalable replica location services

Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Tapestry: a resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

According to data grid characteristics and data-sharing characteristics in distributed environments, we present RepliLoc, a hierarchical replica location approach based on Cache mechanism and load balancing. In RepliLoc, considering storage load and computational load balancing, replica location is classified into community layer and community alliance layer location. On community layer, a circular information dissemination mechanism based on WS model is proposed to locally locate replica. On the other layer, we propose a replica location approach based on prefix matching and DHT. In addition, Cache mechanism is used by both the two layers to shorten query latency. A series of experiments proved that our approach is efficiency and effectiveness.