TY - GEN
T1 - Web service substitution based on preferences over non-functional attributes
AU - Santhanam, Ganesh Ram
AU - Basu, Samik
AU - Honavar, Vasant
PY - 2009
Y1 - 2009
N2 - In many applications involving composite Web services, one or more component services may become unavailable. This presents us with the problem of identifying other components that can take their place, while maintaining the overall functionality of the composite service. Given a choice of candidate substitutions that offer the desired functionality, it is often necessary to select the most preferred substitution based on non-functional attributes of the service, e.g., security, reliability, etc. We propose an approach to this problem using preference networks for representing and reasoning about preferences over non-functional properties. We present algorithms for solving several variants of this problem: a) when the choice of the preferred substitution is independent of the other constituents of the composite service; b) when the choice of the preferred substitution depends on the other constituents of the composite service; and c) when multiple constituents of a composite service need to be replaced simultaneously. The proposed solutions to the service substitution problem based on preferences over non-functional properties are independent of the specific formalism used to represent functional requirements of a composite service as well as the specific algorithm used to assemble the composite service.
AB - In many applications involving composite Web services, one or more component services may become unavailable. This presents us with the problem of identifying other components that can take their place, while maintaining the overall functionality of the composite service. Given a choice of candidate substitutions that offer the desired functionality, it is often necessary to select the most preferred substitution based on non-functional attributes of the service, e.g., security, reliability, etc. We propose an approach to this problem using preference networks for representing and reasoning about preferences over non-functional properties. We present algorithms for solving several variants of this problem: a) when the choice of the preferred substitution is independent of the other constituents of the composite service; b) when the choice of the preferred substitution depends on the other constituents of the composite service; and c) when multiple constituents of a composite service need to be replaced simultaneously. The proposed solutions to the service substitution problem based on preferences over non-functional properties are independent of the specific formalism used to represent functional requirements of a composite service as well as the specific algorithm used to assemble the composite service.
UR - http://www.scopus.com/inward/record.url?scp=74049128260&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=74049128260&partnerID=8YFLogxK
U2 - 10.1109/SCC.2009.21
DO - 10.1109/SCC.2009.21
M3 - Conference contribution
AN - SCOPUS:74049128260
SN - 9780769538112
T3 - SCC 2009 - 2009 IEEE International Conference on Services Computing
SP - 210
EP - 217
BT - SCC 2009 - 2009 IEEE International Conference on Services Computing
T2 - SCC 2009 - 2009 IEEE International Conference on Services Computing
Y2 - 21 September 2009 through 25 September 2009
ER -