Earticle

초록

영어

In Quorum based cross datacenter distributed storage systems, data replication is a widely used technology. Such systems usually choose weak consistency, means they prone to select less number of replicas in read request in order to improve the performance, which lead to the possibility of getting stale data. In this paper, we propose an adaptive replica selection algorithm to make sure the system does not exceed specific stale read ratio while achieving good performance. Firstly, we choose a suitable distribution model from many candidates to estimate the time interval between current read request and nearest write request before it. Then we use Monte-Carlo method to simulate the processing order of read request and write request in different replicas. At last we use those estimated values to determine minimal number of replicas each read request needs to select in order to achieve a specific consistency level. We conduct a comprehensive experiments and the result shows our algorithm is effective.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Background
 4. Replica Selection Algorithm
  4.1. Select Suitable Distribution Model to Estimate Reach Time of Recent Update Request
  4.2. Using Monte-Carlo Method to Estimate Response Sequence of Read and Write Request
 5. Experiment
  5.1. Impact on Network Latency
  5.2. Impact on Throughput
  5.3 Actual Number of Stale Data
 6. Conclusion
 References

키워드

저자

• Zhen Ye [ Lishui Univeristy ]
• Weijian Hu [ Lishui Univeristy ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605