Preference Based Service Adaptation Using Service Substitution
Lists
Only you see this
Abstract
In many applications such as service-oriented computing, users often prefer some compositions over the others based on their preferences over non-functional attributes such as security and cost. After a composition is deployed, apart from changes in the functional requirements, service-oriented architectures often have to deal with changes in the user preferences over the non-functional attributes and/or repository of available components. We formulate the problem of adaptation as iterative substitution of appropriate components in a composition, and provide two algorithms that produce a sequence of increasingly preferred adaptations with time: a fast algorithm that searches for preferred adaptations by improving the valuation of the relatively more important attributes, and another that is computationally more intensive but guaranteed to produce at least one preferred adaptation, if one exists.
BibTeX
@inproceedings{santhanam2013preference,
author = {Ganesh Ram Santhanam and Samik Basu and Vasant G. Honavar},
title = {{Preference Based Service Adaptation Using Service Substitution}},
booktitle = {Web Intelligence},
year = {2013},
doi = {10.1109/wi-iat.2013.68},
}Loading related content...