Modelling and comparing cloud computing service level agreements

Fatima Alkandari*, Richard F. Paige

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Service-level agreements are a critical mechanism underpinning the pay-per-consumption model of business for cloud computing. Cloud providers make a variety of services of different qualities available on-demand for consumers. However, there is no standard ontology, vocabulary, or set of mechanisms that can be used for systematically and semi-automatically expressing and comparing cloud SLAs. We report on research investigating the use of MDE principles and technologies for making cloud SLAs easier to write, use and semi-automatically compare by domain experts. Our ultimate objective is to make it easier for non-experts to take decisions by programmatically comparing different cloud SLAs. We propose a metamodel for both cloud consumer requirement and cloud provider SLAs, and exploit model comparison technology for automating the comparison process.

Original languageEnglish
Title of host publication1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing, MDHPCL 2012 - Satellite Event of MODELS 2012
DOIs
Publication statusPublished - 1 Dec 2012
Event1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing, MDHPCL 2012, Held as a Satellite Event of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems, MODELS 2012 - Innsbruck, Austria
Duration: 2 Oct 20122 Oct 2012

Conference

Conference1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing, MDHPCL 2012, Held as a Satellite Event of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems, MODELS 2012
Country/TerritoryAustria
CityInnsbruck
Period2/10/122/10/12

Keywords

  • cloud computing
  • model comparison
  • service level agreement

Cite this