A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation

We present an extension of the Soft Concurrent Constraint language that allows the nonmonotonic evolution of the constraint store. To accomplish this, we introduce some new operations: the retract(c) reduces the current store by c, the updateX(c) transactionally relaxes all the constraints of the st...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Electronic notes in theoretical computer science Ročník 236; s. 147 - 162
Hlavní autoři:	Bistarelli, Stefano, Santini, Francesco
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 02.04.2009
Témata:	nonmonotonicity quality of service service level agreement soft constraint logic programming quality of service nonmonotonicity soft constraint logic programming service level agreement
ISSN:	1571-0661, 1571-0661
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	We present an extension of the Soft Concurrent Constraint language that allows the nonmonotonic evolution of the constraint store. To accomplish this, we introduce some new operations: the retract(c) reduces the current store by c, the updateX(c) transactionally relaxes all the constraints of the store that deal with the variables in the set X, and then adds a constraint c; the nask(c) tests if c is not entailed by the store. We present this framework as a possible solution to the management of resources (e.g. web services and network resource allocation) that need a given Quality of Service (QoS). The QoS requirements of all the parties should converge, through a negotiation process, on a formal agreement defined as the Service Level Agreement, which specifies the contract that must be enforced. c-semirings are the algebraic structures that we use to model QoS metrics.
ISSN:	1571-0661 1571-0661
DOI:	10.1016/j.entcs.2009.03.020