Please use this identifier to cite or link to this item:
https://idr.l4.nitk.ac.in/jspui/handle/123456789/7438
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Anithakumari, S. | |
dc.contributor.author | Chandra, Sekaran, K. | |
dc.date.accessioned | 2020-03-30T09:59:06Z | - |
dc.date.available | 2020-03-30T09:59:06Z | - |
dc.date.issued | 2014 | |
dc.identifier.citation | Communications in Computer and Information Science, 2014, Vol.420 CCIS, , pp.151-159 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7438 | - |
dc.description.abstract | Cloud computing has developed into a more acceptable computing paradigm for implementing scalable infrastructure resources given on-demand in a pay-by-use basis. Self-adaptable cloud resources are needed to meet users application needs defined by Service Level Agreements (SLAs) and to limit the amount of human interactions with the processing environment. Sufficient SLA monitoring techniques and timely discovery of possible SLA violations are of principal importance for both cloud providers and cloud customers. The identification of possible violations of SLA is done by analyzing predefined service level objectives together by using knowledgebases for managing and preventing such violations. In this paper we propose a new architecture for the detection of SLA violation and also for the re-negotiation of established SLAs in the case of multiple SLA violations. This re-negotiation of SLAs will really help to limit the over provisioning of resources and thus leads to the optimum usage of resources. As a consolidation the proposed architecture may yield maximized Business Level Objectives (BLOs) to the cloud providers. � Springer-Verlag Berlin Heidelberg 2014. | en_US |
dc.title | Autonomic SLA Management in Cloud Computing Services | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.