Risk analysis of cloud service providers by analyzing the frequency of occurrence of problems using E-Eclat algorithm
- 23 Downloads
Cloud is a large scale distributed system where the resource provisioning is a challenging and important problem. It may be statically or dynamically provisioned and must meet the QoS parameters such as throughput, availability, security, transit delay and thereby ensuring SLA. Nowadays the number of service providers tends to increase tremendously in the market, hence selecting an optimal service provider is a tedious process which leads to trust a third party known as cloud service brokers. They analyzes the problems with the provider and explores the providers to the consumers to make the service available. But the risks with the providers are not known by the consumers and as well as the trusted cloud service brokers. Hence the proposed work indulges in finding the risk with the providers in the broker’s registry by analyzing the past histories of them. The analysis will be carried out for a period of time for all the providers and the most important problems that occur during the period will be considered for prioritizing the providers. Hence this paper proposes a novel Enhanced Eclat algorithm for finding the frequent problems at the providers level and also the frequency of occurrence of the same with each provider. The proposed E-Eclat algorithm is compared with two other algorithms and found that it consumes reduced time than other algorithms. It is also observed that the complexity is much low than other two algorithms as transpose scanning is used.
KeywordsRisk analysis Cloud provider selection Cloud provider analysis
This work is financially supported by Science and Engineering Research Board (SERB), Department of Science and Technology (DST), Government of India, under the Early Career Research Award Scheme. The Grant Number of the project is ECR/2016/000546.
- 10.Sato, H., Kanai, A., & Tanimoto, S. (2010). A cloud trust model in a security aware cloud. In Proceedings of 10th IEEE/IPSJ international symposium on applications and the internet (SAINT) (pp. 121–124). IEEE.Google Scholar
- 11.Li, X., Zhou, L., Shi, Y., & Guo, Y. (2010). A trusted computing environment model in cloud architecture. In Proceedings of 2010 international conference on machine learning and cybernetics (ICMLC) (Vol. 6, pp. 2843–2848). IEEE.Google Scholar
- 12.Schryen, G., Volkamer, M., Ries, S., & Habib, S. M. (2011) A formal approach towards measuring trust in distributed systems. In Proceedings of the 2011 ACM symposium on applied computing (pp. 1739–1745). ACM.Google Scholar
- 14.Noor, T., & Sheng, Q. (2011). Trust as a service: A framework for trust management in cloud environments. In Web information system engineering–WISE 2011 (pp. 314–321).Google Scholar
- 20.Pacheco, C. (2005). Eclat: Automatic generation and classification of test inputs. Massachusetts: Massachusetts Institute of Technology.Google Scholar
- 21.Zak, M. J., Gouda, K. (2003) Fast vertical mining using diffsets. In Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 326–335).Google Scholar
- 22.Agrawal, R., & Srikant, R. (1994) Fast algorithms for mining association rules in large databases. In Proceedings 20th international conference very large data bases (VLDB "94) (pp. 478–499).Google Scholar
- 23.Moens, S., Aksehirli, E., & Goethals, B. (2013). Frequent itemset mining for big data. In IEEE international conference on big data (pp. 111–118).Google Scholar
- 24.Huang, Y., & Lin, S. (2003). Mining sequential patterns using graph search techniques. In Proceedings 27th annual international computer software and applications conference (pp. 4–9).Google Scholar