Rigel: A Scalable and Lightweight Replica Selection Service for Replicated Distributed File System

Authors:
Yuan Lin;Yang Chen;Guodong Wang;Beixing Deng
Affiliations:
-;-;-;-
Venue:
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Year:
2010

Citing 4
Cited 1

The Google file system

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Vivaldi: a decentralized network coordinate system

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
OpenDHT: a public DHT service and its uses

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Stable and Accurate Network Coordinates

ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems

Dynamic replica placement and selection strategies in data grids- A comprehensive survey

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Replicated distributed file systems are designed to store large file reliably across lots of machines, and it arouse the problem of selecting the nearest replica for clients. In this paper, we propose Rigel, a Network Coordinates (NC) based nearest replica selection service, which is an effective infrastructure to select the nearest replica for client in a scalable and lightweight way. Our simulation results have demonstrated that Rigel can at least reduce the read latency between clients and replicas by 20% when compared to the replica selection strategy in Hadoop Distributed File System.