Availability Allocation for Distributed Clusters of the Cloud Infrastructure

Article Preview

Abstract:

The cloud environment capitalizes on the built-in redundancy of the large number of servers that make them up by enabling high levels of availability and reliability for applications. In this paper, we address the availability problem of the heterogeneous distributed clusters in the cloud and propose an availability allocation model with the goal of maximizing the system reliability. The allocation model involves three kinds of services according to the coupling classification. And the availability analysis scheme is designed for each coupling type. Besides, the prior knowledge of all the server availability value is imported to simplify the service disposal and achieve an optimal solution in a short time. The experiments show that this algorithm finds a good initial solution for availability allocation problem.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 712-715)

Pages:

2653-2658

Citation:

Online since:

June 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] A. Weiss. Computing in the clouds: ACM Networker Vol 11(2007), pp.18-25.

Google Scholar

[2] M. Brantner, D. Florescuy, D. Graf, et al. Building a database on S3, in: Proceedings of the ACM SIGMOD/PODS Conference, Canada( 2008), pp.251-263.

Google Scholar

[3] R. Buyya, C. S. Yeo and S. Venugopal. Market-oriented cloud computing: vision, hype, and reality for delivering IT service as computing utilities, in: Proceedings of the 10th IEEE International Conference on High Performance Computing and Communications, Los Alamitos, CA, USA(2008).

DOI: 10.1109/hpcc.2008.172

Google Scholar

[4] R. Grossman and Y. Gu. Data mining using high performance data clouds: experiments studies using sector and sphere, in: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, USA(2008), pp.920-927.

DOI: 10.1145/1401890.1402000

Google Scholar

[5] C. Hui and S. Chanson. Allocating task interaction graphs to processors in heterogeneous networks: IEEE Trans. Parallel Distributed Systems Vol 8(1997).

DOI: 10.1109/71.615437

Google Scholar

[6] M. Kafil and I. Ahmed. Optimal task assignment in heterogeneous distributed computing systems: IEEE Concurrency Vol 6(1998), pp.42-51.

DOI: 10.1109/4434.708255

Google Scholar

[7] S. Hariri and H. Mutlu. Hierarchical modelling of availability in distributed systems: IEEE Transactions on Software Engineering Vol 21(1998), pp.50-58.

Google Scholar

[8] S. Chern. On the computational complexity of reliability redundancy allocation in a series system: Operations Research Letters Vol 11(1992), pp.309-315.

DOI: 10.1016/0167-6377(92)90008-q

Google Scholar

[9] M. Gen and Y. Yun. Soft computing approach for reliability optimization: state-of-the-art survey: Reliability Engineering and System Safety Vol 91(2006), pp.1008-1026.

DOI: 10.1016/j.ress.2005.11.053

Google Scholar