Towards a Formal Specification of SLAs with Compensations (COOPIS 2014)
•
0 likes•318 views
Recommended
Recommended
More Related Content
Similar to Towards a Formal Specification of SLAs with Compensations (COOPIS 2014)
Similar to Towards a Formal Specification of SLAs with Compensations (COOPIS 2014) (20)
Recently uploaded
Recently uploaded (20)
Towards a Formal Specification of SLAs with Compensations (COOPIS 2014)
- 1. Towards a Formal Specification of SLAs with Compensations CoopIS 2014, Amantea
- 2. Prof. Dr. Antonio Ruiz-‐Cortés
- 3. SLA ?
- 4. 4
- 5. Provision Compliance Monitor Workload optimization QoS SLA Customizing Pricing Service Level Objective
- 6. SLA
- 10. What is my risk? Should I change my provider? Am I using all the resources that I paid for? Can I be more competitive? Can I accept more customers? Should I break my guarantees? SLA
- 15. Compensations Pricing Availability Analysis SLA-‐Driven SaaS Compensable SLA Compensable Guarantee
- 17. SLO Compensations Compensable SLA = Compensations + SLOs
- 18. Compensation Function Service property PenaltiesRewards rewarded neutral penalized
- 19. v1 ≤ v2 (IncreasingUtility Function) v1 ≥ v2 (Decreasing Utility Function) Interest Precedence PenaltiesRewards rewarded neutral penalized
- 20. Valid = Consistent + Saturated PenaltiesRewards rewarded neutral penalized
- 21. Total elapsed days until delivery is less than 20% of planned
- 22. SLO PenaltiesRewards rewarded neutral penalized Compensable Guarantee = Compensation Function + SLO Valid = Valid (CF) + Consistent(SLO,CF)
- 27. Modeling Scalability Engine Claiming Engine Risk Dashboard Analysis Purchising What is my risk? Should I change my provider? Am I using all the resources that I paid for? Can I be more competitive? Can I accept more customers? Should I break my guarantees? Towards automation of Governance SLA
- 28. Thank you!!
Editor's Notes
- LITTLE ROBOT THAT MAKE COMPUTERS TO FALL IN LOVE SYSTEM INTEGRATION AS LOVE: NON-FUNCTIONAL ISSUES ARE IMPORTANT
- Semantics Priority Principle. while keeping close to the iAgree conceptual model (SLA ≈ CSP…) The target domain and style, (CSP in this case) must be chosen according to the source model. Thus, an iAgree document is, in esence a set of expressions that can be interpreted as constraints. In this sense the expressiveness of condition languages must match the expressiveness supported by the underlying CSP solver.