A Framework for SLA Management in Cloud Computing for Informed Decision Making
dc.contributor.author | Hussain, Omar | |
dc.contributor.author | Hussain, Farookh | |
dc.contributor.author | Hammadi, Adil | |
dc.contributor.author | Dillon, T. | |
dc.date.accessioned | 2017-01-30T11:44:16Z | |
dc.date.available | 2017-01-30T11:44:16Z | |
dc.date.created | 2013-01-02T20:00:22Z | |
dc.date.issued | 2012 | |
dc.identifier.citation | Hammadi, Adil and Hussain, Omar Khadeer and Dillon, Tharam and Hussain, Farookh Khadeer. 2012. A Framework for SLA Management in Cloud Computing for Informed Decision Making. Cluster Computing. December. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/14521 | |
dc.identifier.doi | 10.1007/s10586-012-0232-9 | |
dc.description.abstract |
In cloud computing, service providers offer costeffective and on-demand IT services to service users on the basis of Service Level Agreements (SLAs). However the effective management of SLAs in cloud computing is essential for the service users to ensure that they achieve the desired outcomes from the formed service. In this paper, we introduce a SLA management framework that will enable serviceusers to select the best available service provider on the basis of its reputation and then monitor the run time performance of the service provider to determine whether or not it will fulfill its promise defined in the SLA. Such analysis will assist the service user to make an informed decision about the continuation of service with the service provider. | |
dc.publisher | Springer | |
dc.subject | Financial risk | |
dc.subject | Performance risk | |
dc.subject | Transactional risk | |
dc.subject | Reputation | |
dc.subject | Service level agreement | |
dc.title | A Framework for SLA Management in Cloud Computing for Informed Decision Making | |
dc.type | Journal Article | |
dcterms.source.volume | Dec 2012 | |
dcterms.source.issn | 13867857 | |
dcterms.source.title | Cluster Computing | |
curtin.department | ||
curtin.accessStatus | Fulltext not available |