CLOUD COMPUTING - SERVICE LEVEL AGREEMENT REQUIREMENT PARAMETER MATCHING

Abstract

Cloud computing is a technology that has evolved and gained popularity among masses and IT giants with great pace. Basically, Cloud is a large pool of easily available and accessible virtualized resources such as hardware, platform for development and services. It provides on-demand pay-per-use computing resources and acts as a substitute to conventional IT framework. As more and more consumers are going for „cloud‟ to accomplish their tasks, Service Level Agreement (SLA) between consumer and provider becomes an important aspect. SLA is the document of contract between the cloud providers and the cloud consumers and defines some statements of rules and parameters that must be agreed by the both cloud providers and consumers. Since the nature of cloud is dynamic, the matching of SLA templates need to be dynamic. SLA template contains many parameters like cloud‟s resources (physical memory, main memory, processor speed etc) and properties (availability, response time etc). This work addresses the issue of matching SLA parameter of application requirements and available clouds. A simple and structural method is presented in this work based on permanent function to identify compatible cloud for particular set of application requirements. Permanent function is a standard matrix function that is used in combinatorial mathematics. Ryser‟s equation is used to calculate the permanent of matrices and according to him no polynomial algorithm for permanent computation is known so far. This work gives suggestion to the consumer in terms of number of matched parameters. A cloud having maximum number of matched parameters with the requirements of an application is a compatible cloud for that application.