2011 IEEE World Congress on Services 2011
DOI: 10.1109/services.2011.16
|View full text |Cite
|
Sign up to set email alerts
|

Formal Verification of SLA Transformations

Abstract: Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. The mapping between what constitutes desirable performance and SLAs is not unique: multiple SLA expressions might be functionally equivalent. Having the flexibility to transform SLAs from one form to another in a manner that is provably safe would enable hosting solutions to achieve signif… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 32 publications
0
4
0
Order By: Relevance
“…Ishakian et al in [29] present a formal verification for SLA transformations. Their framework enables users to propose specific transformation rules, which are fed to an SLA transformation engine, in order to explore any possible safe co-location configurations in a cloud setting.…”
Section: Running Examplementioning
confidence: 99%
“…Ishakian et al in [29] present a formal verification for SLA transformations. Their framework enables users to propose specific transformation rules, which are fed to an SLA transformation engine, in order to explore any possible safe co-location configurations in a cloud setting.…”
Section: Running Examplementioning
confidence: 99%
“…Lines 9-14 construct the tree by adding each task and its transformations at the leafs of the tree, Then prunes the branches of the tree where solutions exceed the current best solution. Finally, the best solution is returned (lines [15][16]. Repacking Policies: Our WRS service could be instantiated based on one of three possible repacking policies: No Repacking (NR), Periodic Repacking (PR), and Forced Repacking (FR).…”
Section: Procedures 1 Repack(hostlist): Wrs Repack Heuristicmentioning
confidence: 99%
“…Most works provide a customized manner to structure the SLAs contents, which are then formalized via mathematical tuple, e.g. in [7,8,12,14,24]; in other works the authors use concepts from set theory, e.g. in [23] and [8]; the other used formalism include derivation rules, reaction rules, integrity rules and deontic rules [20], or mathematical logic concepts [24].…”
Section: Introductionmentioning
confidence: 99%