2010
DOI: 10.1007/978-3-642-16132-2_22
|View full text |Cite
|
Sign up to set email alerts
|

Dealing with Fixable and Non-fixable Properties in Service Matchmaking

Abstract: Abstract. In the context of service discovery, matchmakers check the compliance of service-level objectives from providers and consumers. The problem of bounded uncertainty arises if some property is non-fixable. In this case, the provider is not able to control the value it takes at runtime, so the eventual consumer must not have the choice to select a value and fix it, but only knowing the guaranteed range of values it may take. To the best of our knowledge, there does not exist any approach which deals with… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…However, is does not take care of adaptation issues and controlling values at run-time. In [16], the authors discuss about fixable and non-fixable properties to deal with bounded uncertainty issue. Constraint programming is used as a solution for the said issue, however, there is no evaluation of the work.…”
Section: Related Workmentioning
confidence: 99%
“…However, is does not take care of adaptation issues and controlling values at run-time. In [16], the authors discuss about fixable and non-fixable properties to deal with bounded uncertainty issue. Constraint programming is used as a solution for the said issue, however, there is no evaluation of the work.…”
Section: Related Workmentioning
confidence: 99%