WSEAS Transactions on Information Science and Applications
Print ISSN: 1790-0832, E-ISSN: 2224-3402
Volume 14, 2017
QoS-aware and Behavior-based Approximate Matching of Stateful Web Services
Authors: , , ,
Abstract: We present a tool that is able to discover stateful web services in a database, ranked according to a similarity score expressing the affinities between each service and a user-submitted query. To determine these affinities, we also take behavior into account, both of the user’s query and of the services. The names of service operations, their order of invocation, and their parameters may differ from those required by the user’s query, so long as they collectively represent similar behavior. We introduce a light extension of WSDL, namely BWSDL to describe the behavior of web services as well, then we develop a GUI to ease this kind of service specification. We use soft constraints to formalize the requirements that a user expresses in her query. We argue that a proper formalization of the behavior of many services that are commonly thought of as stateless, in fact requires a stateful representation. As such, our method and our tool can accommodate discovery of these services better than alternatives that consider them as stateless. Our tool uses a procedure to asses an approximate operational-similarity score among Soft Constraint Automata, which we use as formal models of behavior. The discovery is modelled as a Constraint Optimization Problem. Finally, we enhance our tool by also considering QoS metrics to further meet user’s needs, and we present a peer-to-peer implementation to overcome scalability issues.
Search Articles
Keywords: Weighted argumentation frameworks, Coalition formation, Soft constraint satisfaction problems
Pages: 239-271
WSEAS Transactions on Information Science and Applications, ISSN / E-ISSN: 1790-0832 / 2224-3402, Volume 14, 2017, Art. #25