A Novel Response Time-Driven Replica Selection Approach for Cloud Computing

Article Preview

Abstract:

Data replication techniques are used in cloud computing to reduce access latency, network bandwidth and enhance data availability, system reliability. Replica selection involves selecting the best replica location to access the data for job execution in cloud computing. In order to select the best replica, a novel response time-driven replica selection approach based on Dirichlet probability distribution (DPRS) is proposed in this paper. Dirichlet PDF is the conjugate prior of categorical distribution to predict the posteriori value. The response time is calculated based on the network parameters such as network bandwidth, file size and access latency. The best replica can be predicted in corresponding with the historical log file by using Dirichlet PDF. Simulation results show that DPRS method conducts high performance in lower mean response time, while compared with No replica, LRU and LFU strategies.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

146-150

Citation:

Online since:

February 2014

Export:

Price:

[1] Wang, L., Luo, J., Shen, J. & Dong, F. Cost and time aware ant colony algorithm for data replica in alpha magnetic spectrometer experiment. IEEE 2nd International Congress on Big Data (pp.254-261), (2013).

DOI: 10.1109/bigdata.congress.2013.41

Google Scholar

[2] W. Hoschek, J. Jean-Martinez, A. Samar, H. Stockinger, and K. Stockinger, Data management in an international data grid project, Proceedings of the First IEEE/ACM International Workshop on Grid Computing, pp.77-90, Springer-Verlag, UK, (2000).

DOI: 10.1007/3-540-44444-0_8

Google Scholar

[3] D. J. Abadi, Data management in the cloud: limitations and opportunities, IEEE Data Engineering Bulletin, Vol. 32, No. 1, pp.3-12, (2009).

Google Scholar

[4] Wolfson O, Milo A. The multicast policy and its relationship to replicated data placement. ACM Transactions on Database System, 16(1): 181–205, (1991).

DOI: 10.1145/103140.103146

Google Scholar

[5] Rehn-Sonigo, V, Optimal replica placement in tree networks with QOS and bandwidth constraints and the closest allocation policy, Technical Report, No. 6233, INRIA, (2007).

DOI: 10.1007/978-0-387-72498-0_3

Google Scholar

[6] Tu M, Li P, Xiao L, Yen I-L, Bastani FB. Replica placement algorithms for mobile transaction systems. IEEE Transactions on Knowledge and Data Engineering, 18(7): 954–70, (2006).

DOI: 10.1109/tkde.2006.114

Google Scholar

[7] Rahman RM, Alhajj R, Barker K. Replica selection strategies in data grid. Journal of Parallel and Distributed Computing, 68: 1561–74, (2008).

DOI: 10.1016/j.jpdc.2008.07.013

Google Scholar

[8] Y. Zhao, Y. Hu, GRESS: a grid replica selection service, in: Proceedings of the 16th International Conference on Parallel and Distributed Computing Systems, p.423–429, (2003).

Google Scholar

[9] B. A. Frigyik, A. Kapila, M. R. Gupta, Introduction to the Dirichlet Distribution and Related Processes, UWEE Tech Report UWEETR, (2010).

Google Scholar