SLAs and Sample Clauses
SLAs and. SLA ▇▇▇▇▇▇▇▇▇▇▇ In Section 1 we referred briefly to service hierarchies and the corresponding SLA hierarchies. Each SLA governs the consumption of one or more services, by one or more consumers. Involved parties have specific obligations to comply with and/or specific gains to expect. In order to carry out its obligations, a service provider involved in a SLA may have to subcontract, that is to establish one or more additional SLAs with parties not directly involved in the initial one. This kind of dependency between the original contract and the subcontracts may take many different forms. It may be related to capacity, functionality limitations, fail- over capabilities, or may represent some other aspect of the provider’s modus operandi and business model. As such, it is very generic and makes it difficult to identify exactly how the state of one contract affects the state of another. We formulate a proposed SLA representation as follows: Let Φn be the universe of facts applicable to contracts as indisputable truth, Φn = {φ1, ..., φn}. Also let Y m be the universe of clauses which can be evaluated to either true or false, Y m = {y1, ..., ym}. A Service Level Agreement is the boolean function f : f : Fk ∪ Zl → {0, 1} (4) where Fk Φn, Fk = φ1, ..., φk and Zl Y m, Zl = z1, ..., zl . We therefore have a representation of a SLA as a boolean function, taking advantage of a SLA’s binary nature upon evaluation as possible / impossible to satisfy (at negotiation time) or honored / violated (at runtime, i.e. while the service is being consumed). The variable terms of a SLA are taking values from Zl, while pre-agreed understanding and in general facts about the world is encoded in facts accepting values from Fk. This definition is broad enough to en- compass various previous definitions, both conceptual (e.g. [11]) and syntactical (e.g. WS-Agreement). We are now ready to codify SLA dependencies in a generic way, that allows enough flexibility to describe any such kind. Let:
