Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.